1. 3.3 Linear Programming

2. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the maximum or minimum value of the graph. The process of maximizing or minimizing the objective function is called linear programming. Feasible region: the intersections of the graph. : the common shaded area.

3. Use Linear Programming to Maximize the Profit (EX 1) Constraints: x ≥ 4 y ≤ 0 5x + 4y ≤ 40 Objective Function: P = 35x + 30y Steps: 1)Graph the constraints 2)Shade the feasible region 3)Label the ordered pairs that are the intersections of the feasible region. 4)Use the ordered pairs to substitute into the objective function to determine the maximum and minimum value.

4. Checking Vertices Practice Problems: Page 176 (1-6)