1. 1.6 Linear Programming
Pg. 30

2. Solve Linear Programming Problems
In 1.4 and 1.5 we have learned to graph Linear Inequalities and Systems of Linear Inequalities, now we will extend this one step further.
We will use terms like Objective Function and Constraints, to find our Feasible Region. If this region is bounded, then our objective function will have maximum and minimum values on the region, these are found at the vertices of the constraints

3. Maximize Profits

4. Work Area

6. Example 2
Graph the constraints and find the vertices

7. Step 2 (Find the min and max of the objective function)

8. Homework
Pg 32
1 – 9 all
Pg 33, 1 – 6 all