1. 5.6 - 1 Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.

2. 2 5.6 Systems of Inequalities and Linear Programming Solving Linear Inequalities Solving Systems of Inequalities Linear Programming

3. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 3 Solving Linear Inequalities A linear inequality in two variables is an inequality of the form where A, B, and C are real numbers, with A and B not both equal to 0. (The symbol  could be replaced with ,.) The graph of a linear inequality is a half-plane, perhaps with its boundary.

4. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 4 Graph First graph the boundary, 3x – 2y = 6, as shown in the figure. Since the points of the line 3x – 2y = 6 satisfy 3x – 2y < 6, this line is part of the solution set. Example 1 GRAPHING A LINEAR INEQUALITY Solution

5. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 5 To decide which half-plane (the one above the line 3x – 2y = 6 or the one below the line) is part of the solution set, solve the original inequality for y. Subtract 3x. Divide by − 2. Reverse the inequality symbol when dividing by a negative number. Example 1 GRAPHING A LINEAR INEQUALITY

6. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 6 For a particular value of x, the inequality will be satisfied by all values of y that are greater than or equal to Thus, the solution set contains the half-plane above the line. Example 1 GRAPHING A LINEAR INEQUALITY Coordinates for x and y from the solution set (the shaded region) satisfy the original inequality, while coordinates outside the solution set do not.

7. 5.6 - 7 Copyright © 2013, 2009, 2005 Pearson Education, Inc. 7 Caution A linear inequality must be in slope-intercept form (solved for y) to determine, from the presence of a symbol, whether to shade the lower or upper half-plane. In the previous slide, the upper half-plane is shaded, even though the inequality is 3x – 2y  6 is (with a < symbol) in standard form. Only when we write the inequality as (slope-intercept form) does the > symbol indicate to shade the upper half-plane.

8. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 8 Example 2 GRAPHING A LINEAR INEQUALITY Graph x + 4y > 4. Solution The boundary of the graph is the straight line x + 4y = 4. Since points on this line do not satisfy x + 4y > 4, it is customary to make the line dashed. To decide which half-plane represents the solution set, solve for y.

9. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 9 Example 2 GRAPHING A LINEAR INEQUALITY Subtract x. Divide by 4. Since y is greater than the graph of the solution set is the half-plane above the boundary.

10. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 10 Example 2 GRAPHING A LINEAR INEQUALITY Original inequality. Use (0, 0) as a test point. Alternatively, or as a check, choose a test point not on the boundary line and substitute into the inequality. The point (0, 0) is a good choice if it does not lie on the boundary, since the substitution is easily done. False

11. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 11 Example 2 GRAPHING A LINEAR INEQUALITY Since the point (0, 0) is below the boundary, the points that satisfy the inequality must be above the boundary, which agrees with the result.

12. 5.6 - 12 Copyright © 2013, 2009, 2005 Pearson Education, Inc. 12 Graphing an Inequality in Two Variables Method 1 If the inequality is or can be solved for y, then the following hold. The graph of y <  (x) consists of all the points that are below the graph of y =  (x). The graph of y >  (x) consists of all the points that are above the graph of y =  (x).

13. 5.6 - 13 Copyright © 2013, 2009, 2005 Pearson Education, Inc. 13 Graphing an Inequality in Two Variables Method 2 If the inequality is not or cannot be solved for y, choose a test point not on the boundary. If the test point satisfies the inequality, the graph includes all points on the same side of the boundary as the test point. If the test point does not satisfy the inequality, the graph includes all points on the other side of the boundary.

14. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 14 Solving Systems of Inequalities The solution set of a system of inequalities, such as is the intersection of the solution sets of its members. We find this intersection by graphing the solution sets of all inequalities on the same coordinate axes and identifying, by shading, the region common to all graphs.

15. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 15 Example 3 GRAPHING SYSTEMS OF INEQUALITIES Solution (a) Graph the solution set of each system. The figures show the graphs of x > 6 – 2y and x 2 < 2y. The methods presented earlier in this chapter can be used to show that the boundaries intersect at the points (2, 2) and (–3, 9/2).

16. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 16 Example 3 GRAPHING SYSTEMS OF INEQUALITIES Solution (a) Graph the solution set of each system. The solution set of the system is shown. Since the points on the boundaries of x > 6 – 2y and x2 < 2y do not belong to the graph of the solution set, the boundaries are dashed.

17. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 17 Example 3 GRAPHING SYSTEMS OF INEQUALITIES Solution (b) Graph the solution set of each system. Writing  x   3 as – 3  x  3 shows that this inequality is satisfied by points in the region between and including x = – 3 and x = 3.

18. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 18 Example 3 GRAPHING SYSTEMS OF INEQUALITIES The set of points that satisfies y  0 includes the points below or on the x-axis.

19. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 19 Example 3 GRAPHING SYSTEMS OF INEQUALITIES Graph y =  x  + 1 and use a test point to verify that the solutions of y   x  + 1 are on or above the boundary.

20. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 20 Example 3 GRAPHING SYSTEMS OF INEQUALITIES Since the solution sets of y  0 and y   x  +1 have no points in common, the solution set of the system is ø. The solution set of the system is ø, because there are no points common to all three regions.

21. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 21 Note While we gave three graphs in the solutions of Example 3, in practice we usually give only a final graph showing the solution set of the system.

22. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 22 Example 4 FINDING A MAXIMUM PROFIT The Charlson Company makes two products: MP3 players and DVD players. Each MP3 gives a profit of $30, while each DVD player produces $70 profit. The company must manufacture at least 10 MP3 players per day to satisfy one of its customers, but it can manufacture no more than 50 per day because of production restrictions. The number of DVD players produced cannot exceed 60 per day, and the number of MP3 players cannot exceed the number of DVD players. How many of each should the company manufacture to obtain maximum profit?

23. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 23 Example 4 Solution First we translate the statement of the problem into symbols. Let x = number of MP3 players to be produced daily, and y = number of DVD players to be produced daily. The company must produce at least 10 MP3 players (10 or more), so Since no more than 50 MP3 players may be produced, FINDING A MAXIMUM PROFIT

24. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 24 Example 4 Solution No more than 60 DVD players may be made in one day, so The number of MP3 players may not exceed the number of DVD players, so The numbers of MP3 players and of DVD players cannot be negative, so FINDING A MAXIMUM PROFIT

25. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 25 Example 4 Solution These restrictions, or constraints, form the following system of inequalities. Each MP3 player gives a profit of $30, so the daily profit from production of x MP3 players is 30x dollars. Also, the profit from production of y DVD players will be 70y dollars per day. Therefore, the total daily profit is This equation defines the objective function to be maximized. FINDING A MAXIMUM PROFIT

26. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 26 Example 4 Solution To find the maximum possible profit, subject to these constraints, we sketch the graph of each constraint. FINDING A MAXIMUM PROFIT

27. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 27 Example 4 Solution The only feasible values of x and y are those that satisfy all constraints— that is, the values that lie in the intersection of the graphs. FINDING A MAXIMUM PROFIT

28. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 28 Example 4 Solution Any point lying inside the shaded region or on the boundary satisfies the restrictions as to the number of MP3 and DVD players that can be produced. FINDING A MAXIMUM PROFIT

29. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 29 Example 4 Solution (For practical purposes, however, only points with integer coefficients are useful.) This region is called the region of feasible solutions. The vertices (singular vertex) or corner points of the region of feasible solutions have coordinates FINDING A MAXIMUM PROFIT

30. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 30 Example 4 We must find the value of the objective function 30x + 70y for each vertex. We want the vertex that produces the maximum possible value of 30x + 70y. Maximum The maximum profit, obtained when 50 MP3 players and 60 DVD players are produced each day, will be 30(50) + 70(60) = $5700 dollars per day. FINDING A MAXIMUM PROFIT

31. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 31 Example 4 The Charlson Company needed to find values of x and y in the shaded region that produce the maximum profit—that is, the maximum value of 30x + 70y. To locate the point (x, y) that gives the maximum profit, add to the graph lines corresponding to arbitrarily chosen profits of $0, $1000, $3000, and $7000: To justify the procedure used in Example 4, consider the following. FINDING A MAXIMUM PROFIT

32. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 32 Example 4 For instance, each point on the line 30x + 70y = 3000 corresponds to production values that yield a profit of $3000. The figure shows the region of feasible solutions, together with these lines. The lines are parallel, and the higher the line, the greater the profit. The line 30x + 70y = 7000 yields the greatest profit but does not contain any points of the region of feasible solutions. FINDING A MAXIMUM PROFIT

33. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 33 Example 4 To find the feasible solution of greatest profit, lower the line 30x + 70y = 7000 until it contains a feasible solution—that is, until it just touches the region of feasible solutions. This occurs at point A, a vertex of the region. This discussion can be generalized. FINDING A MAXIMUM PROFIT

34. 5.6 - 34 Copyright © 2013, 2009, 2005 Pearson Education, Inc. 34 Fundamental Theorem of Linear Programming If an optimal value for a linear programming problem exists, it occurs at a vertex of the region of feasible solutions.

35. 5.6 - 35 Copyright © 2013, 2009, 2005 Pearson Education, Inc. 35 Solving a Linear Programming Problem Step 1 Write the objective function and all necessary constraints. Step 2 Graph the region of feasible solutions. Step 3 Identify all vertices (corner points). Step 4 Find the value of the objective function at each vertex. Step 5 The solution is given by the vertex producing the optimal value of the objective function.

36. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 36 Example 5 FINDING A MINIMUM COST Robin takes multivitamins each day. She wants at least 16 units of vitamin A, at least 5 units of vitamin B 1 and at least 20 units of vitamin C. Capsules, costing $0.10 each, contain 8 units of A, 1 of B 1 and 2 of C. Chewable tablets, costing $0.20 each, contain 2 units of A, 1 of B 1 and 7 of C. How many of each should she take each day to minimize her cost and yet fulfill her daily requirements?

37. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 37 Example 5 Step 1 Let x represent the number of capsules to take each day, and let y represent the number of chewable tablets to take. Then the cost in pennies per day is FINDING A MINIMUM COST Objective function Solution

38. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 38 Example 5 Robin takes x of the $0.10 capsules and y of the $0.20 chewable tablets, and she gets 8 units of vitamin A from each capsule and 2 units of vitamin A from each tablet. Altogether she gets 8x + 2y units of A per day. Since she wants at least 16 units, FINDING A MINIMUM COST

39. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 39 Example 5 Each capsule and each tablet supplies 1 unit of vitamin B 1. Robin wants at least 5 units per day, so For vitamin C, the inequality is Since Robin cannot take negative numbers of multivitamins, FINDING A MINIMUM COST x  0 and y  0.

40. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 40 Example 5 Step 2 The figure shows the intersection of the graphs of FINDING A MINIMUM COST

41. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 41 Example 5 Step 3 The vertices are (0, 8), (1, 4), (3, 2), and (10, 0). FINDING A MINIMUM COST

42. Copyright © 2013, 2009, 2005 Pearson Education, Inc. 42 Example 5 Steps 4 and 5 The minimum cost occurs at (3, 2). PointCost = 10x + 20y (0, 8) 10(0) + 20(8) = 160 (1, 4)10(1) + 204) = 90 (3, 2)10(3) + 20(2) = 70 (10, 0)10(10) + 20(0) = 100 Minimum Robin’s best choice is to take 3 capsules and 2 chewable tablets, for a total cost of $0.70 per day. She receives just the minimum amounts of vitamins B 1 and C, and an excess of vitamin A. FINDING A MINIMUM COST