1. SECTION 3.4 Systems of Linear Inequalities

2. Warm Up 1.Graph y < -x +12. Graph the system.

3. Systems of Linear Inequalities A system of linear inequalities is a collection of linear inequalities in the same variables. The solution is any ordered pair that satisfies each of the inequalities in the system. (anything in the shaded region. Each of the linear inequalities is called a boundary line for the solution.

4. Systems of Linear Inequalities Graph the system:

5. Systems of Linear Inequalities Graph the system:

6. Systems of Linear Inequalities Graph the system:

7. Systems of Linear Inequalities Graph the system:

8. Systems of Linear Inequalities Graph the system:

9. Systems of Linear Inequalities Graph the system:

10. Systems of Linear Inequalities Write the system of inequalities graphed at right. 1.Find equations for the boundary lines. 2.Give each boundary line the appropriate inequality symbol. A (0,4) B (3, 5) C (6, 0)

11. Linear Programing A method called linear programming is used to find optimal solutions such as the maximum revenue. Linear-programming problems have the following characteristics: The inequalities contained in the problem are called constraints. The solution to the set of constraints is called the feasible region. The function to be maximized or minimized is called the objective function.

12. Linear Programming: Example 1 Max Desmond is a farmer who plants corn and wheat. In making planting decisions, he used the 2010 statistics from the U.S. Bureau of Census below: Mr. Desmond wants to plan according to the following constraints: No more than 120 acres of corn and wheat At least 20 and no more than 80 acres of corn At least 30 acres of wheat CropYield per acreAverage Price Corn113.5 bu$3.15/bu Wheat35.8 bu$4.45/bu

13. Linear Programming: Example 1 Mr. Desmond wants to plan according to the following constraints: No more than 120 acres of corn and wheat At least 20 and no more than 80 acres of corn At least 30 acres of wheat 1.Write a system of inequalities to represent the constraints.

14. Linear Programming: Example 1 2.Graph the feasible region.

15. Linear Programming: Example 1 3.Write an objective function for the revenue from Mr. Desmond’s harvest. R = (yield per acre)(average price)x + (yield per acre)(average price)y CropYield per acreAverage Price Corn113.5 bu$3.15/bu Wheat35.8 bu$4.45/bu

16. Linear Programming 1.Copy and complete the table to find the revenue at each of the four vertices of the feasible region from Example 1. 2.Which vertex represents the greatest revenue? 3.What do the coordinates of the vertex represent? 4.Guess and check: Choose points on the boundary lines of the feasible region. Find the corresponding revenues for these points. Can you find a point that gives a greater revenue than the vertex you chose in Step 2? 5.Guess and check: Choose points inside the feasible region. Find the corresponding revenues for these points. Can you find a point that gives a greater revenue than the vertex you chose in Step 2? 6.Do your investigations suggest that the maximum value of the objective function occurs at a vertex? Justify your response. 7.Look for a pattern: Repeat steps 2-6 for the minimum revenue instead of the max revenue. Explain how the points that correspond to the maximum and minimum revenues are related. VertexObjective function A (20, 30)R = 357.525(20) + 159.31(30) B (20, 100) C (80, 40) D (80, 30)

17. Linear Programming Corner-Point Principle In linear programming, the maximum and minimum values of the objective function each occur at one of the vertices of the feasible region.

18. Linear Programming: Example 2

20. Finding Corner-Points using your calculator 1.Put as many of the inequalities in slope-intercept form 2. Graph inequalities as equations in calculator 3.Find the intersections of all lines drawn on picture 4.Be sure to go back and take into consideration any equation(s) that could not be put in slope-intercept form i.e. x <23  graphed as x = 23 5.Write down all of the vertices as you find them. 6.Plug each vertex into the Objective Function to find the maximum and/or minimum.

21. Linear Programming: Example 3