1. Linear Programming Advanced Math Topics Mrs. Mongold

2. Linear Programming Def: A process that can be used to solve certain decision-making problems where a linear combination is to be maximized or minimized

3. Linear Combination Def: An expression in the form of ax + by where “a” and “b” are constants –f(x, y)= 12x + 15y

4. Constraints Def: Any condition that must be met by a variable or by a linear combination… a system of linear inequalities Example: 3x + 2y -4, y > -4

5. Feasible Region Def: the graph of the solution of a system of inequalities that meets all given constraints… the points that make all of the constraints true! This will form a shape

6. Corner Points Principle Def: The Maximum of Minimum value of a linear combination will occur at one of the vertices of the feasible region.

8. Worksheet