MATA33H3 Lecture Notes - Lecture 3: Linear Programming, Feasible Region, Bounded Set
MATA33H3 verified notes
3/3View all
Document Summary
Linear programming: linear programming is about maximizing or minimizing and objective function subject to constraints. Linear function: a linear function in x and y is a function of two variables of the form. Optimization: to optimize a function is to either maximize or minimize it depending on the nature of the problem. Objective function: the function to be optimized is called teh objective function. Feasible region, feasible points: the region defined by the system of linear constraints is called the feasible region. A point in the feasible region is called a feasible point. Suppose a company produces two products, a and b, in three stages using three machines. The amount of time needed on each machine, the hours available on each machine, and the profit for selling a and b are summarized in the following table: Solution: let x and y denote the number of products a and b the company produces respectively.
