1. Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework

3. 3.4 – Linear Programming Objectives: 1.Be able to apply a linear program to maximize or minimize the objective function Vocabulary: optimization, objective function, constraints, feasible region, bounded region, unbounded region

4. Linear Programming 1.Identify objective function and constraints 2.Graph the constraints (feasible region) 3.Find the vertices 4.Test the vertices in the objective function to determine maximum and minimum

5. Apply linear program to maximize or minimize the objective function Optimization – to reduce the bad and maximize the good Manufacturing – reduce cost, maximize revenue Ex1. Objective Function: C = -x + 3y Constraints: x > 2 x < 5 y > 0 y < -2x + 12 minimum -5 maximum 22

6. Ex. 2 Objective Function: C = x + 4y Constraints: x > 2 x < 5 y > 1 y < 6 minimum 6 maximum 29

7. Ex. 3 Objective Function: C = x + 5y Constraints: x > 0 y < 2x + 2 5 > x + y no minimum maximum 21

8. Assignment: pgs. 166-167 #10-16 even Chapter 3 Test on Friday, October 19 th