333353_APPF1.

qxp 1/22/07 9:01 AM Page A106

A106 Appendix F Systems of Inequalities

Appendix F: Systems of Inequalities

F.1 Solving Systems of Inequalities
What you should learn
The Graph of an Inequality
Sketch graphs of inequalities in two
The statements 3x 2y < 6 and 2x 2 3y 2 6 are inequalities in two vari- variables.
ables. An ordered pair a, b is a solution of an inequality in x and y if the Solve systems of inequalities.
inequality is true when a and b are substituted for x and y, respectively. The graph Use systems of inequalities in two
of an inequality is the collection of all solutions of the inequality. To sketch the variables to model and solve real-life
graph of an inequality, begin by sketching the graph of the corresponding equa- problems.
tion. The graph of the equation will normally separate the plane into two or more Why you should learn it
regions. In each such region, one of the following must be true.
Systems of inequalities in two variables
1. All points in the region are solutions of the inequality. can be used to model and solve real-life
2. No point in the region is a solution of the inequality. problems. For instance, Exercise 81 on page
A115 shows how to use a system of inequali-
So, you can determine whether the points in an entire region satisfy the inequal- ties to analyze the compositions of dietary
ity by simply testing one point in the region. supplements.

Sketching the Graph of an Inequality in Two Variables

1. Replace the inequality sign with an equal sign and sketch the graph
of the corresponding equation. Use a dashed line for < or > and a
solid line for or . (A dashed line means that all points on the line
or curve are not solutions of the inequality. A solid line means that
all points on the line or curve are solutions of the inequality.)
2. Test one point in each of the regions formed by the graph in Step 1.
If the point satisfies the inequality, shade the entire region to denote
that every point in the region satisfies the inequality.

Example 1 Sketching the Graph of an Inequality

Sketch the graph of y x 2 1 by hand.

Solution
Begin by graphing the corresponding equation y x 2 1, which is a parabola,
as shown in Figure F.1. By testing a point above the parabola 0, 0 and a point
below the parabola 0, 2, you can see that 0, 0 satisfies the inequality because
0 0 2 1 and that 0, 2 does not satisfy the inequality because
2 > 02 1. So, the points that satisfy the inequality are those lying above and
those lying on the parabola. Figure F.1

Now try Exercise 9.

The inequality in Example 1 is a nonlinear inequality in two variables. Most

of the following examples involve linear inequalities such as ax by < c (a
and b are not both zero). The graph of a linear inequality is a half-plane lying on
one side of the line ax by c.
333353_APPF1.qxp 1/22/07 9:01 AM Page A107

Appendix F.1 Solving Systems of Inequalities A107

Example 2 Sketching the Graphs of Linear Inequalities TECHNOLOGY TIP

A graphing utility can be used to
Sketch the graph of each linear inequality.
graph an inequality. For instance,
a. x > 2 b. y 3 to graph y x 2, enter
y x 2 and use the shade
Solution feature of the graphing utility to
a. The graph of the corresponding equation x 2 is a vertical line. The points shade the correct part of the
that satisfy the inequality x > 2 are those lying to the right of (but not on) graph. You should obtain the
this line, as shown in Figure F.2. graph shown below.
b. The graph of the corresponding equation y 3 is a horizontal line. The points 6
that satisfy the inequality y 3 are those lying below (or on) this line, as
shown in Figure F.3.
9 9
y y

4 y3 4 y=3
x > 2 6
3
2 2 For instructions on how to use the
1 1 shade feature, see Appendix A;
x x for specific keystrokes, go to this
4 3 1 1 2 3 4 4 3 2 1 1 2 3 4 textbooks Online Study Center.
1 1
x = 2 2 2
3 3
4 4

Figure F.2 Figure F.3

y
Now try Exercise 15.
4
xy<2
3

Example 3 Sketching the Graph of a Linear Inequality 2

1
Sketch the graph of x y < 2. (0, 0)
x
4 3 2 1 1 2 3 4
Solution 1
The graph of the corresponding equation x y 2 is a line, as shown in Figure 2
xy=2
F.4. Because the origin 0, 0 satisfies the inequality, the graph consists of the
half-plane lying above the line. (Try checking a point below the line. Regardless 4
of which point below the line you choose, you will see that it does not satisfy the
inequality.) Figure F.4
Now try Exercise 17.

To graph a linear inequality, it can help to write the inequality in slope-

intercept form. For instance, by writing x y < 2 in Example 3 in the form
y > x2
you can see that the solution points lie above the line y x 2 or x y 2,
as shown in Figure F.4.
333353_APPF1.qxp 1/22/07 9:01 AM Page A108

A108 Appendix F Systems of Inequalities

Systems of Inequalities
Many practical problems in business, science, and engineering involve systems of
linear inequalities. A solution of a system of inequalities in x and y is a point
x, y that satisfies each inequality in the system.
To sketch the graph of a system of inequalities in two variables, first sketch
the graph of each individual inequality (on the same coordinate system) and then
find the region that is common to every graph in the system. For systems of
linear inequalities, it is helpful to find the vertices of the solution region.

Example 4 Solving a System of Inequalities

Sketch the graph (and label the vertices) of the solution set of the system.
xy < 2

Inequality 1
x > 2 Inequality 2
y 3 Inequality 3

Solution
The graphs of these inequalities are shown in Figures F.4, F.2, and F.3, respec-
tively. The triangular region common to all three graphs can be found by
superimposing the graphs on the same coordinate system, as shown in Figure F.5.
To find the vertices of the region, solve the three systems of corresponding
equations obtained by taking pairs of equations representing the boundaries of the
individual regions and solving these pairs of equations.
Vertex A: 2, 4 Vertex B: 5, 3 Vertex C: 2, 3
xy xy2 x 2
y
2
x 2 y3 3

y
y=3 C = (2, 3)
y
B = (5, 3) STUDY TIP
Using different colored pencils
x = 2
2 to shade the solution of each
1
inequality in a system makes
1
identifying the solution of the
x x system of inequalities easier.
1 1 2 3 4 5 1 1 2 3 4 5
The region common to every
Solution set graph in the system is where all
2 2
xy=2 shaded regions overlap. This
3 3 region represents the solution
A = (2 , 4)
4 4 set of the system.

Figure F.5

Note in Figure F.5 that the vertices of the region are represented by open dots.
This means that the vertices are not solutions of the system of inequalities.
Now try Exercise 47.
333353_APPF1.qxp 1/22/07 9:01 AM Page A109

Appendix F.1 Solving Systems of Inequalities A109

For the triangular region shown in Figure F.5, each point of intersection of a
pair of boundary lines corresponds to a vertex. With more complicated regions,
two border lines can sometimes intersect at a point that is not a vertex of the
region, as shown in Figure F.6. To keep track of which points of intersection are
actually vertices of the region, you should sketch the region and refer to your
sketch as you find each point of intersection.
y

Not a vertex

Figure F.6

Example 5 Solving a System of Inequalities

Sketch the region containing all points that satisfy the system of inequalities.
x2 y 1

Inequality 1
x y 1 Inequality 2

Solution
As shown in Figure F.7, the points that satisfy the inequality x 2 y 1 are the
points lying above (or on) the parabola given by
y x 2 1. Parabola x2 y = 1 y x + y = 1
The points that satisfy the inequality x y 1 are the points lying below (or (2, 3)
3
on) the line given by
y x 1. Line 2

To find the points of intersection of the parabola and the line, solve the system of
corresponding equations. 1

x2 y 1
x y 1 2 2
x

Using the method of substitution, you can find the solutions to be 1, 0 and (1, 0)
2, 3. So, the region containing all points that satisfy the system is indicated by
the purple shaded region in Figure F.7. Figure F.7
Now try Exercise 55.
333353_APPF1.qxp 1/22/07 9:01 AM Page A110

A110 Appendix F Systems of Inequalities

When solving a system of inequalities, you should be aware that the system
might have no solution, or it might be represented by an unbounded region in the
plane. These two possibilities are shown in Examples 6 and 7.

Example 6 A System with No Solution

Sketch the solution set of the system of inequalities.
xy >
x y < 1
3 Inequality 1
Inequality 2

Solution
From the way the system is written, it is clear that the system has no solution,
because the quantity x y cannot be both less than 1 and greater than 3.
Graphically, the inequality x y > 3 is represented by the half-plane lying above
the line x y 3, and the inequality x y < 1 is represented by the half-plane
lying below the line x y 1, as shown in Figure F.8. These two half-planes
have no points in common. So the system of inequalities has no solution.
y
x+y=3
STUDY TIP
3

2
Remember that a solid line rep-
resents points on the boundary
1 of a region that are solutions to
x
the system of inequalities and a
2 1 1 2 3 dashed line represents points on
1 the boundary of a region that are
not solutions. An unbounded
2
region of a graph extending infi-
x + y = 1
nitely in the plane should not be
Figure F.8 No Solution bounded by a solid or dashed
line, as shown in Figure F.9.
Now try Exercise 51.

Example 7 An Unbounded Solution Set

Sketch the solution set of the system of inequalities. y
x y < 3
x 2y > 3
Inequality 1
4
Inequality 2
3 x+y=3
Solution
The graph of the inequality x y < 3 is the half-plane that lies below the line 2
x y 3, as shown in Figure F.9. The graph of the inequality x 2y > 3 is the
half-plane that lies above the line x 2y 3. The intersection of these two half- (3, 0)
x + 2y = 3
planes is an infinite wedge that has a vertex at 3, 0. This unbounded region rep-
x
resents the solution set. 1 1 2 3

Now try Exercise 53. Figure F.9 Unbounded Region

333353_APPF1.qxp 1/22/07 9:01 AM Page A111

Appendix F.1 Solving Systems of Inequalities A111

Applications
The next example discusses two concepts that economists call consumer surplus p

and producer surplus. As shown in Figure F.10, the point of equilibrium is defined
by the price p and the number of units x that satisfy both the demand and supply Demand curve
equations. Consumer surplus is defined as the area of the region that lies below Consumer surplus
the demand curve, above the horizontal line passing through the equilibrium Equilibrium
point, and to the right of the p-axis. Similarly, the producer surplus is defined as point

Price
the area of the region that lies above the supply curve, below the horizontal line
passing through the equilibrium point, and to the right of the p-axis. The con- Producer
sumer surplus is a measure of the amount that consumers would have been will- Supply surplus
ing to pay above what they actually paid, whereas the producer surplus is a meas- curve
ure of the amount that producers would have been willing to receive below what x
they actually received. Number of units
Figure F.10
Example 8 Consumer Surplus and Producer Surplus
The demand and supply functions for a new type of calculator are given by
p 150 0.00001x
p
Demand equation
60 0.00002x Supply equation

where p is the price (in dollars) and x represents the number of units. Find the
consumer surplus and producer surplus for these two equations.

Solution
Begin by finding the point of equilibrium by setting the two equations equal to
each other and solving for x. Supply vs. Demand
p
60 0.00002x 150 0.00001x Set equations equal to each other.
175 p = 150 0.00001x
0.00003x 90 Combine like terms.
Price per unit (in dollars)

150 Consumer
x 3,000,000 Solve for x. surplus
125
So, the solution is x 3,000,000, which corresponds to an equilibrium price of 100
Producer
p $120. So, the consumer surplus and producer surplus are the areas of the surplus
p = 120
following triangular regions. 75

50
Consumer Surplus Producer Surplus p = 60 + 0.00002x
p 150 0.00001x p 60 0.00002x

25

p 120 p 120 x
1,000,000 3,000,000
x 0 x 0 Number of units
In Figure F.11, you can see that the consumer and producer surpluses are defined Figure F.11
as the areas of the shaded triangles.
Consumer
surplus 12(base)(height) 123,000,00030 $45,000,000

Producer
surplus 12(base)(height) 123,000,00060 $90,000,000

Now try Exercise 75.

333353_APPF1.qxp 1/22/07 9:01 AM Page A112

A112 Appendix F Systems of Inequalities

Example 9 Nutrition
The minimum daily requirements from the liquid portion of a diet are 300 calo-
ries, 36 units of vitamin A, and 90 units of vitamin C. A cup of dietary drink X STUDY TIP
provides 60 calories, 12 units of vitamin A, and 10 units of vitamin C. A cup of
dietary drink Y provides 60 calories, 6 units of vitamin A, and 30 units of vitamin When using a system of
C. Set up a system of linear inequalities that describes how many cups of each inequalities to represent a
drink should be consumed each day to meet the minimum daily requirements for real-life application in which
calories and vitamins. the variables cannot be negative,
remember to include inequali-
Solution ties for this constraint. For
Begin by letting x and y represent the following. instance, in Example 9, x and y
cannot be negative, so the
x number of cups of dietary drink X inequalities x 0 and y 0
y number of cups of dietary drink Y must be included in the system.

To meet the minimum daily requirements, the following inequalities must be

satisfied.

60x 60y 300 Calories
12x 6y 36 Vitamin A
10x 30y 90 Vitamin C
x 0
y 0
The last two inequalities are included because x and y cannot be negative. The
graph of this system of inequalities is shown in Figure F.12. (More is said about
this application in Example 6 in Section F.2.)
Liquid Portion of a Diet
y

8
Cups of drink Y

6 (0, 6)
(5, 5)
4 (1, 4)
(3, 2) (8, 2)
2
(9, 0)
x
2 4 6 8 10
Cups of drink X
Figure F.12

From the graph, you can see that two solutions (other than the vertices) that
will meet the minimum daily requirements for calories and vitamins are
5, 5 and 8, 2. There are many other solutions.
Now try Exercise 81.
333353_APPF1.qxp 1/22/07 9:01 AM Page A113

Appendix F.1 Solving Systems of Inequalities A113

F.1 Exercises See www.CalcChat.com for worked-out solutions to odd-numbered exercises.

Vocabulary Check
Fill in the blanks.

1. An ordered pair a, b is a _______ of an inequality in x and y if the inequality is

true when a and b are substituted for x and y, respectively.
2. The _______ of an inequality is the collection of all solutions of the inequality.
3. The graph of a _______ inequality is a half-plane lying on one side of the line ax by c.
4. The _______ of _______ is defined by the price p and the number of units x that satisfy
both the demand and supply equations.

In Exercises 1 8, match the inequality with its graph. [The 1. x < 2

graphs are labeled (a), (b), (c), (d), (e), (f), (g), and (h).] 2. y 3
(a) y (b) y 3. 2x 3y 6
4 6 4. 2x y 2
2 5. x 2 y 2 < 9
x 6. x 2 2 y 3 2 > 9
2 2 7. xy > 1
2 x
2 4 6 8. y 1 x 2
4 2

(c) y (d) y In Exercises 928, sketch the graph of the inequality.

4 6 9. y < 2 x2 10. y 4 x2
2 4 11. y2 1 x 12. y 2 x < 0
x 2 13. x 4 14. x 5
2 2 4 15. y 1 16. y 3
x
2 2 4 17. 2y x 4 18. 5x 3y 15
4 2
19. 2x 3y < 6 20. 5x 2y > 10
y y
(e) (f) 21. 4x 3y 24 22. 2x 7y 28
4 4 23. y > 3x2 1 24. y 9 x2
2 2 25. 2x y > 0
2
26. 4x y 2 > 1
x x 27. x 12 y 2 < 9
2 2 4 2 4
2 28. x 12 y 42 > 9

4 4
In Exercises 2940, use a graphing utility to graph the
(g) y (h) y inequality. Use the shade feature to shade the region repre-
senting the solution.
4 4
2 3
29. y 3x 1 30. y 6 2x
2 2
31. y < 3.8x 1.1 32. y 20.74 2.66x
x x
2 4 2 2 4 33. x 2 5y 10 0 34. 2x 2 y 3 > 0
2 2
1 10
35. y 36. y >
4 4 1 x2 x2 x 4
37. y < ln x 38. y 4 lnx 5
39. y > 3 x4
40. y 22x1 3
333353_APPF1.qxp 1/22/07 9:01 AM Page A114

A114 Appendix F Systems of Inequalities

59. y 3x 1 60. y < x 2 2x 3

In Exercises 41 44, write an inequality for the shaded
region shown in the graph. y x2 1 y > x 2 4x 3
41. y 42. y
y < x3 2x 1 62. y x 4 2x 2 1

61.
4 4
y > 2x y 1 x2
2 2 x 1
x x y ex 2

2
63. x2y 1 64.
2 2 4
2 0 < x 4 y 0
4 4 y 4 2 x 2

43. y 44. y
In Exercises 6574, find a set of inequalities to describe the
4 12 region.
2 8 65. y 66. y

x 4 4 6
2 4
2 x 3 4
4 8 12
2 2
4 4
1 x
2 6
In Exercises 45 and 46, determine whether each ordered x 2
1 2 3 4
pair is a solution of the system of inequalities.
67. y 68. y
2x 5y 3 (a) 0, 2 (b) 6, 4

45.
8 4
y < 4
(c) 8, 2 (d) 3, 2 6 3
4x 2y < 7 4
x2 y2 36 (a) 1, 7 (b) 5, 1

46. 1
3x y 10 x x
2 (c) 6, 0 (d) 4, 8 2 2 4 8
1
1 2 3 4
3x y 5
69. y 70. y
In Exercises 4764, sketch the graph of the solution of the
6
system of inequalities.
1
xy 1 3x 2y < 6

47. 48.
2 x
x y 1 x > 0 1 1
x 1
y 0 y > 0
2 2 4
3x 2y < 6 x 7y > 36 2

49. 50.
x 4y > 2 5x 2y > 5 71. Rectangle: Vertices at 2, 1, 5, 1, 5, 7, 2, 7
2x y < 3 6x 5y > 6 72. Parallelogram: Vertices at 0, 0, 4, 0, 1, 4, 5, 4
51. 3x y y2 52. y2 3x 9 73. Triangle: Vertices at 0, 0, 5, 0, 2, 3
xy > 0 x y 3 74. Triangle: Vertices at 1, 0, 1, 0, 0, 1
53. 2x y < 2 54. x 2y < 6
x 3y > 2 2x 4y > 9 Supply and Demand In Exercises 7578, (a) graph the
system representing the consumer surplus and producer
56. x y > 0
x > y 2 x y < 2
55. x < y 2 2
surplus for the supply and demand equations, and shade the
region representing the solution of the system, and (b) find
the consumer surplus and the producer surplus.
57. x y 9 58. x y 25
x y 1 4x 3y 0
2 2 2 2

2 2 Demand Supply
75. p 50 0.5x p 0.125x
333353_APPF1.qxp 1/22/07 9:01 AM Page A115

Appendix F.1 Solving Systems of Inequalities A115

Demand Supply (b) Sketch the graph of the system in part (a).
76. p 100 0.05x p 25 0.1x 84. Graphical Reasoning Two concentric circles have radii
77. p 300 0.0002x p 225 0.0005x of x and y meters, where y > x (see figure). The area
between the boundaries of the circles must be at least 10
78. p 140 0.00002x p 80 0.00001x square meters.

In Exercises 7982, (a) find a system of inequalities that

models the problem and (b) graph the system, shading the
region that represents the solution of the system.
x
79. Investment Analysis A person plans to invest some or all
of $30,000 in two different interest-bearing accounts. Each y
account is to contain at least $7500, and one account
should have at least twice the amount that is in the other
account.
80. Ticket Sales For a summer concert event, one type of (a) Find a system of inequalities describing the constraints
ticket costs $20 and another costs $35. The promoter of the on the circles.
concert must sell at least 20,000 tickets, including at least (b) Graph the inequality in part (a).
10,000 of the $20 tickets and at least 5000 of the $35 tick- (c) Identify the graph of the line y x in relation to the
ets, and the gross receipts must total at least $300,000 in boundary of the inequality. Explain its meaning in the
order for the concert to be held. context of the problem.
81. Nutrition A dietitian is asked to design a special dietary
supplement using two different foods. The minimum daily Synthesis
requirements of the new supplement are 280 units of calci-
um, 160 units of iron, and 180 units of vitamin B. Each True or False? In Exercises 85 and 86, determine whether
ounce of food X contains 20 units of calcium, 15 units of the statement is true or false. Justify your answer.
iron, and 10 units of vitamin B. Each ounce of food Y con-
85. The area of the figure defined by the system below is 99
tains 10 units of calcium, 10 units of iron, and 20 units of
square units.
vitamin B.

82. Inventory A store sells two models of computers. x 3
Because of the demand, the store stocks at least twice as x 6
many units of model A as units of model B. The costs to the y 5
store for models A and B are $800 and $1200, respective- y 6
ly. The management does not want more than $20,000 in
86. The graph below shows the solution of the system
computer inventory at any one time, and it wants at least
y

four model A computers and two model B computers in y 6
inventory at all times. 4x 9y > 6. 10
8
83. Construction You design an exercise facility that has an 3x y2 2
indoor running track with an exercise floor inside the track 4
(see figure). The track must be at least 125 meters long, and x
the exercise floor must have an area of at least 500 square 8 4 6
meters. 4
6

87. Think About It After graphing the boundary of an

Exercise inequality in x and y, how do you decide on which side of
y the boundary the solution set of the inequality lies?
floor
88. Writing Describe the difference between the solution set
of a system of equations and the solution set of a system of
inequalities.
x
(a) Find a system of inequalities describing the require-
ments of the facility.
333353_APPF2.qxp 1/22/07 9:02 AM Page A116

A116 Appendix F Systems of Inequalities

F.2 Linear Programming

Linear Programming: A Graphical Approach What you should learn
Solve linear programming problems.
Many applications in business and economics involve a process called Use linear programming to model and
optimization, in which you are asked to find the minimum or maximum value of solve real-life problems.
a quantity. In this section, you will study an optimization strategy called
linear programming. Why you should learn it
A two-dimensional linear programming problem consists of a linear Linear programming is a powerful tool
objective function and a system of linear inequalities called constraints. The used in business and industry to manage
resources effectively in order to maximize
objective function gives the quantity that is to be maximized (or minimized), and
profits or minimize costs. For instance, Exercise
the constraints determine the set of feasible solutions. For example, suppose you 36 on page A124 shows how to use linear
are asked to maximize the value of programming to analyze the profitability of
two models of snowboards.
z ax by Objective function

subject to a set of constraints that determines the region in Figure F.13. Because
y
every point in the shaded region satisfies each constraint, it is not clear how you
should find the point that yields a maximum value of z. Fortunately, it can be Feasible
shown that if there is an optimal solution, it must occur at one of the vertices. So, solutions
you can find the maximum value of z by testing z at each of the vertices.
x

Optimal Solution of a Linear Programming Problem Figure F.13

If a linear programming problem has a solution, it must occur at a vertex of
the set of feasible solutions. If there is more than one solution, at least one
of them must occur at such a vertex. In either case, the value of the objective
function is unique.

Here are some guidelines for solving a linear programming problem in two vari-
ables in which an objective function is to be maximized or minimized.

Solving a Linear Programming Problem

1. Sketch the region corresponding to the system of constraints. (The
points inside or on the boundary of the region are feasible solutions.)
2. Find the vertices of the region.
3. Test the objective function at each of the vertices and select the
values of the variables that optimize the objective function. For a
bounded region, both a minimum and a maximum value will exist.
(For an unbounded region, if an optimal solution exists, it will occur
at a vertex.)
333353_APPF2.qxp 1/22/07 9:02 AM Page A117

Appendix F.2 Linear Programming A117

Example 1 Solving a Linear Programming Problem

Find the maximum value of
z 3x 2y Objective function
y
subject to the following constraints.
4

x 0
y 0
Constraints 3
x 2y 4
x y 1 (0, 2) x + 2y = 4
x=0 2

Solution (2, 1)
1
The constraints form the region shown in Figure F.14. At the four vertices of this xy=1
region, the objective function has the following values. (0, 0)
x
1 (1, 0) 2 3
At 0, 0: z 30 20 0 y=0

At 1, 0: z 31 20 3 Figure F.14

At 2, 1: z 32 21 8 Maximum value of z

At 0, 2: z 30 22 4
So, the maximum value of z is 8, and this value occurs when x 2 and y 1.
Now try Exercise 13.
STUDY TIP
Remember that a vertex of a
region can be found using a
In Example 1, try testing some of the interior points in the region. You will system of linear equations.
see that the corresponding values of z are less than 8. Here are some examples. The system will consist of the
equations of the lines passing
At 1, 1: z 31 21 5
through the vertex.
At 1, 2 : z 31 2 2 4
1 1

At 2, 2 : z 3 2 2 2 2
1 3 1 3 9

To see why the maximum value of the objective function in Example 1 must y

occur at a vertex, consider writing the objective function in the form

4
3 z
y x Family of lines
2 2 3

where z2 is the y-intercept of the objective function. This equation represents a

3
family of lines, each of slope 2. Of these infinitely many lines, you want the one 2
that has the largest z-value while still intersecting the region determined by the
3
constraints. In other words, of all the lines with a slope of 2, you want the one 1
that has the largest y-intercept and intersects the given region, as shown in Figure
F.15. It should be clear that such a line will pass through one (or more) of the ver- x
1 1 2
tices of the region.
Figure F.15
333353_APPF2.qxp 1/22/07 9:02 AM Page A118

A118 Appendix F Systems of Inequalities

The next example shows that the same basic procedure can be used to solve
a problem in which the objective function is to be minimized.

Example 2 Solving a Linear Programming Problem

Find the minimum value of
z 5x 7y Objective function

where x 0 and y 0, subject to the following constraints.

2x 3y 6
3x y 15
x y 4
2x 5y 27
Constraints

Solution
y
The region bounded by the constraints is shown in Figure F.16. By testing the
objective function at each vertex, you obtain the following. 5
(1, 5)

At 0, 2: z 50 72 14 Minimum value of z 4
(0, 4) (6, 3)
At 0, 4: z 50 74 28
3
At 1, 5: z 51 75 40 (0, 2)
2
At 6, 3: z 56 73 51
At 5, 0: z 55 70 25 1
(3, 0) (5, 0)
At 3, 0: z 53 70 15 x
1 2 3 4 5 6
So, the minimum value of z is 14, and this value occurs when x 0 and y 2. Figure F.16
Now try Exercise 15.

Example 3 Solving a Linear Programming Problem

Find the maximum value of
z 5x 7y Objective function

where x 0 and y 0, subject to the following constraints.

2x 3y 6
3x y 15
x y 4
2x 5y 27
Constraints

Solution
This linear programming problem is identical to that given in Example 2 above,
except that the objective function is maximized instead of minimized. Using the
values of z at the vertices shown in Example 2, you can conclude that the maxi-
mum value of z is 51, and that this value occurs when x 6 and y 3.
Now try Exercise 21.
333353_APPF2.qxp 1/22/07 9:02 AM Page A119

Appendix F.2 Linear Programming A119

It is possible for the maximum (or minimum) value in a linear programming

problem to occur at two different vertices. For instance, at the vertices of the
region shown in Figure F.17, the objective function
z 2x 2y Objective function
y
has the following values. z = 12 for any
(0, 4) point along
4
At 0, 0: z 20 20 10 (2, 4) this line segment.
At 0, 4: z 20 24 18 3

At 2, 4: z 22 24 12 Maximum value of z
2
At 5, 1: z 25 21 12 Maximum value of z (5, 1)

At 5, 0: z 25 20 10 1
(0, 0) (5, 0)
In this case, you can conclude that the objective function has a maximum value x
1 2 3 4 5
(of 12) not only at the vertices 2, 4 and 5, 1, but also at any point on the line
segment connecting these two vertices, as shown in Figure F.17. Note that by Figure F.17
rewriting the objective function as
1
y x z
2
you can see that its graph has the same slope as the line through the vertices 2, 4
and 5, 1.
Some linear programming problems have no optimal solutions. This can
occur if the region determined by the constraints is unbounded.

Example 4 An Unbounded Region

Find the maximum value of
z 4x 2y Objective function

where x 0 and y 0, subject to the following constraints. y

x 2y 4 5
3x y 7 Constraints (1, 4)
4
x 2y 7
3
Solution
2
The region determined by the constraints is shown in Figure F.18. For this
unbounded region, there is no maximum value of z. To see this, note that the point 1 (2, 1)
x, 0 lies in the region for all values of x 4. By choosing large values of x, you (4, 0)
can obtain values of z 4x 20 4x that are as large as you want. So, there x
is no maximum value of z. For the vertices of the region, the objective function 1 2 3 4 5

has the following values. So, there is a minimum value of z, z 10, which occurs Figure F.18
at the vertex 2, 1.
At 1, 4: z 41 24 12
At 2, 1: z 42 21 10 Minimum value of z
At 4, 0: z 44 20 16
Now try Exercise 31.
333353_APPF2.qxp 1/22/07 9:02 AM Page A120

A120 Appendix F Systems of Inequalities

Applications
Example 5 shows how linear programming can be used to find the maximum
profit in a business application.

Example 5 Optimizing Profit

A manufacturer wants to maximize the profit from selling two types of boxed
chocolates. A box of chocolate covered creams yields a profit of $1.50, and a box
of chocolate covered cherries yields a profit of $2.00. Market tests and available
resources have indicated the following constraints.
1. The combined production level should not exceed 1200 boxes per month.
2. The demand for a box of chocolate covered cherries is no more than half the
demand for a box of chocolate covered creams.
3. The production level of a box of chocolate covered creams is less than or equal
to 600 boxes plus three times the production level of a box of chocolate
covered cherries.

Solution
Let x be the number of boxes of chocolate covered creams and y be the number
of boxes of chocolate covered cherries. The objective function (for the combined
profit) is given by
P 1.5x 2y. Objective function

The three constraints translate into the following linear inequalities.

1. x y 1200 x y 1200
2. y 12 x x 2y 0
3. x 3y 600 x 3y 600
y
Because neither x nor y can be negative, you also have the two additional (800, 400)
constraints of x 0 and y 0. Figure F.19 shows the region determined by the 400
Boxes of chocolate
covered cherries

constraints. To find the maximum profit, test the value of P at each vertex of
300
the region.
At 0, 0: P 1.50 20 0 200
(1050, 150)
At 800, 400: P 1.5800 2400 2000 Maximum profit 100
(0, 0) (600, 0)
At 1050, 150: P 1.51050 2150 1875 x
400 800 1200
At 600, 0: P 1.5600 20 900 Boxes of chocolate
So, the maximum profit is $2000, and it occurs when the monthly production covered creams
consists of 800 boxes of chocolate covered creams and 400 boxes of chocolate Figure F.19
covered cherries.
Now try Exercise 35.
333353_APPF2.qxp 1/22/07 9:02 AM Page A121

Appendix F.2 Linear Programming A121

In Example 5, suppose the manufacturer improves the production of choco-

late covered creams so that a profit of $2.50 per box is obtained. The maximum
profit can now be found using the objective function P 2.5x 2y. By testing
the values of P at the vertices of the region, you find that the maximum profit is
now $2925, which occurs when x 1050 and y 150.

Example 6 Optimizing Cost

The minimum daily requirements from the liquid portion of a diet are 300 calo-
ries, 36 units of vitamin A, and 90 units of vitamin C. A cup of dietary drink X
costs $0.12 and provides 60 calories, 12 units of vitamin A, and 10 units of vita-
min C. A cup of dietary drink Y costs $0.15 and provides 60 calories, 6 units of
vitamin A, and 30 units of vitamin C. How many cups of each drink should be
consumed each day to minimize the cost and still meet the daily requirements?

Solution
As in Example 9 on page A112, let x be the number of cups of dietary drink X Liquid Portion of a Diet
and let y be the number of cups of dietary drink Y. y

For Calories: 60x 60y 300 8

Cups of drink Y
For Vitamin A: 12x 6y 36 (0, 6)
6
For Vitamin C: 10x 30y 90 Constraints
4 (1, 4)
x 0
y 0 (3, 2)
2
The cost C is given by (9, 0)
x
C 0.12x 0.15y. Objective function 2 4 6 8 10
Cups of drink X
The graph of the region determined by the constraints is shown in Figure F.20. To
Figure F.20
determine the minimum cost, test C at each vertex of the region.
At 0, 6: C 0.120 0.156 0.90
At 1, 4: C 0.121 0.154 0.72
At 3, 2: C 0.123 0.152 0.66 Minimum value of C

At 9, 0: C 0.129 0.150 1.08

So, the minimum cost is $0.66 per day, and this cost occurs when three cups of
drink X and two cups of drink Y are consumed each day.
Now try Exercise 37.

TECHNOLOGY TIP You can check the points of the vertices of the
constraints by using a graphing utility to graph the equations that represent
the boundaries of the inequalities. Then use the intersect feature to confirm
the vertices.
333353_APPF2.qxp 1/22/07 9:02 AM Page A122

A122 Appendix F Systems of Inequalities

F.2 Exercises See www.CalcChat.com for worked-out solutions to odd-numbered exercises.

Vocabulary Check
Fill in the blanks.

1. In the process called _______ , you are asked to find the minimum or maximum value of a quantity.
2. The _______ of a linear programming problem gives the quantity that is to be maximized or minimized.
3. The ________ of a linear programming problem determine the set of _______ .

In Exercises 112, find the minimum and maximum values y y

of the objective function and where they occur, subject to 8
the indicated constraints. (For each exercise, the graph of 4 6
the region determined by the constraints is provided.) 3
2 2
1. Objective function: 2. Objective function:
x
1
z 3x 5y z 2x 8y 4 2 4
x
Constraints: Constraints: 1 2 3 5 4

x 0 x 0 Figure for 5 Figure for 6

x y 0 x y 0 7. Objective function: 8. Objective function:
xy 6 2x y 4 z 5x 0.5y z x 6y
y y Constraints: Constraints:
4 See Exercise 5. See Exercise 6.
6
5 3
9. Objective function: 10. Objective function:
4
2
z 10x 7y z 50x 35y
3
2 Constraints: Constraints:
1 1
x x x 0
1 2 3 4 5 6 1 1 2 3 0 x 60
y 0
0 y 45
3. Objective function: 4. Objective function: 8x 9y 7200
5x 6y 420
z 10x 7y z 7x 3y 8x 9y 5400
Constraints: Constraints: y y
See Exercise 1. See Exercise 2.
60
5. Objective function: 6. Objective function:
600
z 3x 2y z 4x 3y 40
300
Constraints: Constraints: 20
x
x 0 x 0 x 300 600
300
20 40
y 0 2x 3y 6
x 3y 15 3x 2y 9 11. Objective function: 12. Objective function:
4x y 16 x 5y 20 z 25x 30y z 15x 20y
Constraints: Constraints:
See Exercise 9. See Exercise 10.
333353_APPF2.qxp 1/22/07 9:02 AM Page A123

Appendix F.2 Linear Programming A123

In Exercises 13 26, sketch the region determined Exploration In Exercises 2730, perform the following.
by the constraints. Then find the minimum and maximum (a) Graph the region bounded by the following constraints.
values of the objective function and where they occur, sub-
ject to the indicated constraints. 3x y } 15
4x 3y } 30
13. Objective function: 14. Objective function: x ~ 0
z 6x 10y z 7x 8y y ~ 0
Constraints: Constraints:
(b) Graph the objective function for the given maximum
x 0 x 0 value of z on the same set of coordinate axes as the
y 0 y 0 graph of the constraints.
1
2x 5y 10 x 2y 4 (c) Use the graph to determine the feasible point or points
that yield the maximum. Explain how you arrived at
15. Objective function: 16. Objective function:
your answer.
z 3x 4y z 4x 5y
Objective Function Maximum
Constraints: Constraints:
27. z 2x y z 12
x 0 x 0
28. z 5x y z 25
y 0 y 0
29. z x y z 10
2x 5y 50 2x 2y 10
30. z 3x y z 15
4x y 28 x 2y 6
17. Objective function: 18. Objective function: In Exercises 3134, the linear programming problem has an
z x 2y z 2x 4y unusual characteristic. Sketch a graph of the solution
region for the problem and describe the unusual character-
Constraints: Constraints:
istic. The objective function is to be maximized in each case.
See Exercise 15. See Exercise 16.
19. Objective function: 20. Objective function: 31. Objective function: 32. Objective function:
z 2x z 3y zxy z 2.5x y
Constraints: Constraints: Constraints: Constraints:
See Exercise 15. See Exercise 16. x 0 x 0
21. Objective function: 22. Objective function: y 0 y 0
z 4x y zx x y 1 3x 5y 15
Constraints: Constraints: x 2y 4 5x 2y 10
x 0 x 0 33. Objective function: 34. Objective function:
y 0 y 0
zxy z x 2y
x 2y 40 2x 3y 60
Constraints: Constraints:
2x 3y 72 2x y 28
x 0 x 0
4x y 48
y 0 y 0
23. Objective function: 24. Objective function:
x y 0 x 10
z x 4y zy
3x y 3 xy 7
Constraints: Constraints:
See Exercise 21. See Exercise 22. 35. Optimizing Revenue An accounting firm has 800 hours
25. Objective function: 26. Objective function: of staff time and 96 hours of reviewing time available each
week. The firm charges $2000 for an audit and $300 for a
z 2x 3y z 3x 2y
tax return. Each audit requires 100 hours of staff time and
Constraints: Constraints: 8 hours of review time. Each tax return requires 12.5 hours
See Exercise 21. See Exercise 22. of staff time and 2 hours of review time. (a) What numbers
of audits and tax returns will yield the maximum revenue?
(b) What is the maximum revenue?
333353_APPF2.qxp 1/22/07 9:02 AM Page A124

A124 Appendix F Systems of Inequalities

36. Optimizing Profit A manufacturer produces two models Synthesis

of snowboards. The amounts of time (in hours) required for
assembling, painting, and packaging the two models are as True or False? In Exercises 39 and 40, determine whether
follows. the statement is true or false. Justify your answer.
39. If an objective function has a maximum value at the adja-
Model A Model B cent vertices 4, 7 and 8, 3, you can conclude that it also
Assembling 2.5 3 has a maximum value at the points 4.5, 6.5 and 7.8, 3.2.
40. When solving a linear programming problem, if the objec-
Painting 2 1 tive function has a maximum value at two adjacent vertices,
you can assume that there are an infinite number of points
Packaging 0.75 1.25
that will produce the maximum value.

The total amounts of time available for assembling, paint- Think About It In Exercises 41 44, find an objective
ing, and packaging are 4000 hours, 2500 hours, and 1500 function that has a maximum or minimum value at the
hours, respectively. The profits per unit are $50 for model indicated vertex of the constraint region shown below.
A and $52 for model B. (There are many correct answers.)
(a) How many of each model should be produced to max-
y
imize profit?
(b) What is the maximum profit? 6

37. Optimizing Cost A farming cooperative mixes two

5
A(0, 4) B(4, 3)
brands of cattle feed. Brand X costs $25 per bag and 3
contains two units of nutritional element A, two units of 2
1 C(5, 0)
nutritional element B, and two units of nutritional element
x
C. Brand Y costs $20 per bag and contains one unit of 1 1 2 3 4 6
nutritional element A, nine units of nutritional element B,
and three units of nutritional element C. The minimum
41. The maximum occurs at vertex A.
requirements for nutritional elements A, B, and C are
12 units, 36 units, and 24 units, respectively. 42. The maximum occurs at vertex B.
(a) Find the number of bags of each brand that should be 43. The maximum occurs at vertex C.
mixed to produce a mixture having a minimum cost per 44. The minimum occurs at vertex C.
bag.
(b) What is the minimum cost? In Exercises 45 and 46, determine values of t such that the
38. Optimizing Cost A pet supply company mixes two objective function has a maximum value at each indicated
brands of dry dog food. Brand X costs $15 per bag and vertex.
contains eight units of nutritional element A, one unit of 45. Objective function: 46. Objective function:
nutritional element B, and two units of nutritional element
z 3x t y z 3x t y
C. Brand Y costs $30 per bag and contains two units of
nutritional element A, one unit of nutritional element B, Constraints: Constraints:
and seven units of nutritional element C. Each bag of x 0 x 0
mixed dog food must contain at least 16 units, 5 units, and y 0 y 0
20 units of nutritional elements A, B, and C, respectively.
x 3y 15 x 2y 4
(a) Find the numbers of bags of brands X and Y that should
be mixed to produce a mixture meeting the minimum 4x y 16 x y 1
nutritional requirements and having a minimum cost (a) 0, 5 (a) 2, 1
per bag. (b) 3, 4 (b) 0, 2
(b) What is the minimum cost?