section 8.6 linear programming - mr. thompson...section 8.6 linear programming 851 t he berlin...

14
Section 8.6 Linear Programming 851 The Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response to military action by the former Soviet Union: Soviet troops closed all roads and rail lines between West Germany and Berlin, cutting off supply routes to the city. The Allies used a mathematical technique developed during World War II to maximize the amount of supplies transported. During the 15-month airlift, 278,228 flights provided basic necessities to blockaded Berlin, saving one of the world’s great cities. In this section, we will look at an important application of systems of linear inequalities. Such systems arise in linear programming, a method for solving problems in which a particular quantity that must be maximized or minimized is limited by other factors. Linear programming is one of the most widely used tools in management science. It helps businesses allocate resources to manufacture products in a way that will maximize profit. Linear programming accounts for more than 50% and perhaps as much as 90% of all computing time used for management decisions in business. The Allies used linear programming to save Berlin. Objective Functions in Linear Programming Many problems involve quantities that must be maximized or minimized. Businesses are interested in maximizing profit. An operation in which bottled water and medical kits are shipped to earthquake survivors needs to maximize the number of survivors helped by this shipment. An objective function is an algebraic expression in two or more variables describing a quantity that must be maximized or minimized. EXAMPLE 1 Writing an Objective Function Bottled water and medical supplies are to be shipped to survivors of an earthquake by plane. Each container of bottled water will serve 10 people and each medical kit will aid 6 people. If x represents the number of bottles of water to be shipped and y represents the number of medical kits, write the objective function that models the number of people that can be helped. Linear Programming SECTION 8.6 Objectives Write an objective function describing a quantity that must be maximized or minimized. Use inequalities to describe limitations in a situation. Use linear programming to solve problems. West Berlin children at Tempelhof airport watch fleets of U.S. airplanes bringing in supplies to circumvent the Soviet blockade. The airlift began June 28, 1948, and continued for 15 months. Write an objective function describing a quantity that must be maximized or minimized.

Upload: others

Post on 29-Mar-2021

4 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Section 8.6 Linear Programming 851

T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response to military action by the former Soviet Union: Soviet troops closed all roads and rail lines between West Germany and Berlin, cutting off supply routes to the city. The Allies used a mathematical technique developed during World War II to maximize the amount of supplies transported. During the 15-month airlift, 278,228 fl ights provided basic necessities to blockaded Berlin, saving one of the world’s great cities.

In this section, we will look at an important application of systems of linear inequalities. Such systems arise in linear programming , a method for solving problems in which a particular quantity that must be maximized or minimized is limited by other factors. Linear programming is one of the most widely used tools in management science. It helps businesses allocate resources to manufacture products in a way that will maximize profi t. Linear programming accounts for more than 50% and perhaps as much as 90% of all computing time used for management decisions in business. The Allies used linear programming to save Berlin.

Objective Functions in Linear Programming Many problems involve quantities that must be maximized or minimized. Businesses are interested in maximizing profi t. An operation in which bottled water and medical kits are shipped to earthquake survivors needs to maximize the number of survivors helped by this shipment. An objective function is an algebraic expression in two or more variables describing a quantity that must be maximized or minimized.

EXAMPLE 1 Writing an Objective Function

Bottled water and medical supplies are to be shipped to survivors of an earthquake by plane. Each container of bottled water will serve 10 people and each medical kit will aid 6 people. If x represents the number of bottles of water to be shippedand y represents the number of medical kits, write the objective function that models the number of people that can be helped.

Linear Programming SECTION 8.6

Objectives � Write an objective

function describing a quantity that must be maximized or minimized.

� Use inequalities to describe limitations in a situation.

� Use linear programming to solve problems.

West Berlin children at Tempelhof airport watch fl eets of U.S. airplanes bringing in supplies to circumvent the Soviet blockade. The airlift began June 28, 1948, and continued for 15 months.

� Write an objective function describing a quantity that must be maximized or minimized.

M14_BLIT7240_06_SE_08-hr.indd 851 13/10/12 12:23 PM

Page 2: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

852 Chapter 8 Systems of Equations and Inequalities

SOLUTION Because each bottle of water serves 10 people and each medical kit aids 6 people, we have

= 10x + 6y.

10 times the numberof bottles of water

6 times the numberof medical kits.

The number ofpeople helped is plus

Using z to represent the number of people helped, the objective function is

z = 10x + 6y.

Unlike the functions that we have seen so far, the objective function is an equation in three variables. For a value of x and a value of y, there is one and only one value of z. Thus, z is a function of x and y. ● ● ●

Check Point 1 A company manufactures bookshelves and desks for computers. Let x represent the number of bookshelves manufactured daily and y the number of desks manufactured daily. The company’s profi ts are $25 per bookshelf and $55 per desk. Write the objective function that models the company’s total daily profi t, z, from x bookshelves and y desks. (Check Points 2 through 4 are related to this situation, so keep track of your answers.)

Constraints in Linear Programming Ideally, the number of earthquake survivors helped in Example 1 should increase without restriction so that every survivor receives water and medical supplies. However, the planes that ship these supplies are subject to weight and volume restrictions. In linear programming problems, such restrictions are called constraints . Each constraint is expressed as a linear inequality. The list of constraints forms a system of linear inequalities.

EXAMPLE 2 Writing a Constraint

Each plane can carry no more than 80,000 pounds. The bottled water weighs 20 pounds per container and each medical kit weighs 10 pounds. Let x represent the number of bottles of water to be shipped and y the number of medical kits. Write an inequality that models this constraint.

SOLUTION Because each plane can carry no more than 80,000 pounds, we have

20x + 10y � 80,000.

Each bottleweighs20 pounds.

The total weight ofthe water bottles

the total weight ofthe medical kits

must be less thanor equal to

80,000pounds.plus

Each kitweighs10 pounds.

The plane’s weight constraint is modeled by the inequality

20x + 10y … 80,000. ● ● ●

Check Point 2 To maintain high quality, the company in Check Point 1 should not manufacture more than a total of 80 bookshelves and desks per day. Write an inequality that models this constraint.

� Use inequalities to describe limitations in a situation.

M14_BLIT7240_06_SE_08-hr.indd 852 13/10/12 12:23 PM

Page 3: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Section 8.6 Linear Programming 853

In addition to a weight constraint on its cargo, each plane has a limited amount of space in which to carry supplies. Example 3 demonstrates how to express this constraint.

EXAMPLE 3 Writing a Constraint

Each plane can carry a total volume of supplies that does not exceed 6000 cubic feet. Each water bottle is 1 cubic foot and each medical kit also has a volume of 1 cubic foot. With x still representing the number of water bottles and y the number of medical kits, write an inequality that models this second constraint.

SOLUTION Because each plane can carry a volume of supplies that does not exceed 6000 cubic feet, we have

1x + 1y � 6000.

Each bottleis 1 cubic foot.

The total volumeof the water

the total volume ofthe medical kits

must be less thanor equal to

6000cubic feet.plus

Each kitis 1 cubic foot.

The plane’s volume constraint is modeled by the inequality x + y … 6000. ● ● ●

In summary, here’s what we have described so far in this aid-to-earthquake-survivors situation:

z = 10x + 6y This is the objective function modeling the number ofpeople helped with x bottles of water and y medical kits.

b20x + 10y … 80,000x + y … 6000.

These are the constraints based on each plane’sweight and volume limitations.

Check Point 3 To meet customer demand, the company in Check Point 1 must manufacture between 30 and 80 bookshelves per day, inclusive. Furthermore, the company must manufacture at least 10 and no more than 30 desks per day. Write an inequality that models each of these sentences. Then summarize what you have described about this company by writing the objective function for its profi ts and the three constraints.

Solving Problems with Linear Programming The problem in the earthquake situation described previously is to maximize the number of survivors who can be helped, subject to each plane’s weight and volume constraints. The process of solving this problem is called linear programming , based on a theorem that was proven during World War II.

� Use linear programming to solve problems.

Solving a Linear Programming Problem

Let z = ax + by be an objective function that depends on x and y. Furthermore, z is subject to a number of constraints on x and y. If a maximum or minimum value of z exists, it can be determined as follows:

1. Graph the system of inequalities representing the constraints. 2. Find the value of the objective function at each corner, or vertex , of the

graphed region. The maximum and minimum of the objective function occur at one or more of the corner points.

M14_BLIT7240_06_SE_08-hr.indd 853 13/10/12 12:23 PM

Page 4: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

854 Chapter 8 Systems of Equations and Inequalities

1000 6000

y

x

8000

6000

1000

(2000, 4000)

(4000, 0)(0, 0)

(0, 6000)

FIGURE 8.29

EXAMPLE 4 Solving a Linear Programming Problem

Determine how many bottles of water and how many medical kits should be sent on each plane to maximize the number of earthquake survivors who can be helped.

SOLUTION We must maximize z = 10x + 6y subject to the following constraints:

b20x + 10y … 80,000x + y … 6000.

Step 1 Graph the system of inequalities representing the constraints. Because x (the number of bottles of water per plane) and y (the number of medical kits per plane) must be nonnegative, we need to graph the system of inequalities in quadrant I and its boundary only.

To graph the inequality 20x + 10y … 80,000, we graph the equation 20x + 10y = 80,000 as a solid blue line ( Figure 8.28 ). Setting y = 0, the x@intercept is 4000 and setting x = 0, the y@intercept is 8000. Using (0, 0) as a test point, the inequality is satisfi ed, so we shade below the blue line, as shown in yellow in Figure 8.28 .

Now we graph x + y … 6000 by fi rst graphing x + y = 6000 as a solid red line. Setting y = 0, the x@intercept is 6000. Setting x = 0, the y@intercept is 6000. Using (0, 0) as a test point, the inequality is satisfi ed, so we shade below the red line, as shown using green vertical shading in Figure 8.28 .

We use the addition method to fi nd where the lines 20x + 10y = 80,000 and x + y = 6000 intersect.

1000 6000

y

x

8000

6000

1000

(2000, 4000)

(4000, 0)(0, 0)

(0, 6000)

20x + 10y = 80,000

x + y = 6000

FIGURE 8.28 The region in quadrant Irepresenting the constraints 20x + 10y … 80,000 and x + y … 6000

b20x + 10y = 80,000x + y = 6000

No change

"

Multiply by - 10.

"

Add:

b 20x + 10y = 80,000-10x - 10y = -60,000

10x = 20,000 x = 2000

Back-substituting 2000 for x in x + y = 6000, we fi nd y = 4000, so the intersection point is (2000, 4000).

The system of inequalities representing the constraints is shown by the region in which the yellow shading and the green vertical shading overlap in Figure 8.28 . The graph of the system of inequalities is shown again in Figure 8.29 . The red and blue line segments are included in the graph.

Step 2 Find the value of the objective function at each corner of the graphed region. The maximum and minimum of the objective function occur at one or more of the corner points. We must evaluate the objective function, z = 10x + 6y, at the four corners, or vertices, of the region in Figure 8.29 .

Corner (x, y)

Objective Function z � 10x � 6y

(0, 0) z = 10(0) + 6(0) = 0

(4000, 0) z = 10(4000) + 6(0) = 40,000

(2000, 4000) z = 10(2000) + 6(4000) = 44,000 d maximum

(0, 6000) z = 10(0) + 6(6000) = 36,000

Thus, the maximum value of z is 44,000 and this occurs when x = 2000 and y = 4000. In practical terms, this means that the maximum number of earthquake survivors who can be helped with each plane shipment is 44,000. This can be accomplished by sending 2000 water bottles and 4000 medical kits per plane. ● ● ●

Check Point 4 For the company in Check Points 1–3, how many bookshelves and how many desks should be manufactured per day to obtain maximum profi t? What is the maximum daily profi t?

M14_BLIT7240_06_SE_08-hr.indd 854 13/10/12 12:23 PM

Page 5: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Section 8.6 Linear Programming 855

EXAMPLE 5 Solving a Linear Programming Problem

Find the maximum value of the objective function

z = 2x + y

subject to the following constraints:

c x Ú 0, y Ú 0x + 2y … 5x - y … 2.

SOLUTION We begin by graphing the region in quadrant I (x Ú 0, y Ú 0) formed by the constraints. The graph is shown in Figure 8.30 .

Now we evaluate the objective function at the four vertices of this region.

Maximumvalue of zAt (3, 1): z = 2 � 3+1=7

At (0, 0): z = 2 � 0+0=0

At (2, 0): z = 2 � 2+0=4

At (0, 2.5): z = 2 � 0+2.5=2.5

Objective function: z � 2x � y

Thus, the maximum value of z is 7, and this occurs when x = 3 and y = 1. ● ● ●

We can see why the objective function in Example 5 has a maximum value that occurs at a vertex by solving the equation for y.

z = 2x + y

Slope = −2 y-intercept = z

y = –2x+z

−1

12

4

67

5

−2−3

1 3 4 765−1−2−3

y

x

x + 2y = 5

(0, 0)

(2, 0)

(3, 1)

(0, 2.5)

x − y = 2

FIGURE 8.30 The graph ofx + 2y … 5 and x - y … 2 inquadrant I

This is the objective function of Example 5. Solve for y. Recall that the slope-intercept form of a line is y = mx + b.

In this form, z represents the y@intercept of the objective function. The equation describes infi nitely many parallel lines, each with slope -2. The process in linear programming involves fi nding the maximum z@value for all lines that intersect the region determined by the constraints. Of all the lines whose slope is -2, we’re looking for the one with the greatest y@intercept that intersects the given region. As we see in Figure 8.31 , such a line will pass through one (or possibly more) of the vertices of the region.

Check Point 5 Find the maximum value of the objective function z = 3x + 5y subject to the constraints x Ú 0, y Ú 0, x + y Ú 1, x + y … 6.

−1

1234

67

5

−2−3

1 32 4 765−1−2−3

y

x

FIGURE 8.31 The line with slope-2 with the greatest y@intercept that intersects the shaded region passes through one of its vertices.

1. A method for fi nding the maximum or minimum value of a quantity that is subject to various limitations is called .

2. An algebraic expression in two or more variables describing a quantity that must be maximized or minimized is called a/an function.

3. A system of linear inequalities is used to represent restrictions, or , on a function that must be maximized or minimized. Using the graph of such a system of inequalities, the maximum and minimum values of the function occur at one or more of the points.

Fill in each blank so that the resulting statement is true .

CONCEPT AND VOCABULARY CHECK

M14_BLIT7240_06_SE_08-hr.indd 855 13/10/12 12:23 PM

Page 6: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

856 Chapter 8 Systems of Equations and Inequalities

Application Exercises 15. A television manufacturer makes rear-projection and plasma

televisions. The profi t per unit is $125 for the rear-projection televisions and $200 for the plasma televisions. a. Let x = the number of rear-projection televisions

manufactured in a month and let y = the number of plasma televisions manufactured in a month. Write the objective function that models the total monthly profi t.

b. The manufacturer is bound by the following constraints:

• Equipment in the factory allows for making at most 450 rear-projection televisions in one month.

• Equipment in the factory allows for making at most 200 plasma televisions in one month.

• The cost to the manufacturer per unit is $600 for the rear-projection televisions and $900 for the plasma televisions. Total monthly costs cannot exceed $360,000.

Write a system of three inequalities that models these constraints.

10. Objective Function Constraints

z = 5x - 2y

c 0 … x … 50 … y … 3x + y Ú 2

11. Objective Function Constraints

z = 4x + 2y

d x Ú 0, y Ú 02x + 3y … 123x + 2y … 12x + y Ú 2

12. Objective Function Constraints

z = 2x + 4y

d x Ú 0, y Ú 0x + 3y Ú 6x + y Ú 3x + y … 9

13. Objective Function Constraints

z = 10x + 12y

d x Ú 0, y Ú 0x + y … 72x + y … 102x + 3y … 18

14. Objective Function Constraints

z = 5x + 6y

d x Ú 0, y Ú 02x + y Ú 10x + 2y Ú 10x + y … 10

EXERCISE SET 8.6

Practice Exercises In Exercises 1–4, fi nd the value of the objective function at each corner of the graphed region. What is the maximum value of the objective function? What is the minimum value of the objective function?

In Exercises 5–14, an objective function and a system of linear inequalities representing constraints are given.

a. Graph the system of inequalities representing the constraints.

b. Find the value of the objective function at each corner of the graphed region.

c. Use the values in part (b) to determine the maximum value of the objective function and the values of x and y for which the maximum occurs.

1. Objective Function z = 5x + 6y

y

x(1, 2)

(8, 3)

(7, 5)

(2, 10)

2. Objective Function z = 3x + 2y

y

x(3, 2)

(7, 4)

(4, 10)

(8, 6)

(5, 12)

3. Objective Function z = 40x + 50y

y

x(0, 0) (8, 0)

(0, 8)

(4, 9)

4. Objective Function z = 30x + 45y

y

x(0, 0)

(4, 4)

(3, 0)

(0, 9)

5. Objective Function Constraints

z = 3x + 2y

c x Ú 0, y Ú 02x + y … 8

x + y Ú 4

6. Objective Function Constraints

z = 2x + 3y

c x Ú 0, y Ú 02x + y … 82x + 3y … 12

7. Objective Function Constraints

z = 4x + y

c x Ú 0, y Ú 02x + 3y … 12x + y Ú 3

8. Objective Function Constraints

z = x + 6y

c x Ú 0, y Ú 02x + y … 10x - 2y Ú -10

9. Objective Function Constraints

z = 3x - 2y

c 1 … x … 5y Ú 2x - y Ú -3

M14_BLIT7240_06_SE_08-hr.indd 856 13/10/12 12:23 PM

Page 7: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Section 8.6 Linear Programming 857

c. Graph the system of inequalities in part (b). Use only the fi rst quadrant and its boundary, because x and y must both be nonnegative.

d. Evaluate the objective function for total monthly profi t at each of the fi ve vertices of the graphed region. [The vertices should occur at (0, 0), (0, 200), (300, 200), (450, 100), and (450, 0).]

e. Complete the missing portions of this statement: The television manufacturer will make the greatest profi t by manufacturing rear-projection televisions each month and plasma televisions each month. The maximum monthly profi t is $ .

16. a. A student earns $10 per hour for tutoring and $7 per hour as a teacher’s aide. Let x = the number of hours each week spent tutoring and let y = the number of hours each week spent as a teacher’s aide. Write the objective function that models total weekly earnings.

b. The student is bound by the following constraints:

• To have enough time for studies, the student can work no more than 20 hours per week.

• The tutoring center requires that each tutor spend at least three hours per week tutoring.

• The tutoring center requires that each tutor spend no more than eight hours per week tutoring.

Write a system of three inequalities that models these constraints.

c. Graph the system of inequalities in part (b). Use only the fi rst quadrant and its boundary, because x and y are nonnegative.

d. Evaluate the objective function for total weekly earnings at each of the four vertices of the graphed region. [The vertices should occur at (3, 0), (8, 0), (3, 17), and (8, 12).]

e. Complete the missing portions of this statement: The student can earn the maximum amount per week by tutoring for hours per week and working as a teacher’s aide for hours per week. The maximum amount that the student can earn each week is $ .

Use the two steps for solving a linear programming problem, given in the box on page 853 , to solve the problems in Exercises 17–23.

17. A manufacturer produces two models of mountain bicycles. The times (in hours) required for assembling and painting each model are given in the following table:

Model A Model B

Assembling 5 4

Painting 2 3

The maximum total weekly hours available in the assembly department and the paint department are 200 hours and 108 hours, respectively. The profi ts per unit are $25 for model A and $15 for model B. How many of each type should be produced to maximize profi t?

18. A large institution is preparing lunch menus containing foods A and B. The specifi cations for the two foods are given in the following table:

Food Units of Fatper Ounce

Units ofCarbohydrates

per Ounce

Units ofProtein

per Ounce

A 1 2 1

B 1 1 1

Each lunch must provide at least 6 units of fat per serving, no more than 7 units of protein, and at least 10 units of carbohydrates. The institution can purchase food A for $0.12 per ounce and food B for $0.08 per ounce. How many ounces of each food should a serving contain to meet the dietary requirements at the least cost?

19. Food and clothing are shipped to survivors of a natural disaster. Each carton of food will feed 12 people, while each carton of clothing will help 5 people. Each 20-cubic-foot box of food weighs 50 pounds and each 10-cubic-foot box of clothing weighs 20 pounds. The commercial carriers transporting food and clothing are bound by the following constraints:

• The total weight per carrier cannot exceed 19,000 pounds. • The total volume must be less than 8000 cubic feet.

How many cartons of food and clothing should be sent with each plane shipment to maximize the number of people who can be helped?

20. On June 24, 1948, the former Soviet Union blocked all land and water routes through East Germany to Berlin. A gigantic airlift was organized using American and British planes to bring food, clothing, and other supplies to the more than 2 million people in West Berlin. The cargo capacity was 30,000 cubic feet for an American plane and 20,000 cubic feet for a British plane. To break the Soviet blockade, the Western Allies had to maximize cargo capacity but were subject to the following restrictions:

• No more than 44 planes could be used. • The larger American planes required 16 personnel per

fl ight, double that of the requirement for the British planes. The total number of personnel available could not exceed 512.

• The cost of an American fl ight was $9000 and the cost of a British fl ight was $5000. Total weekly costs could not exceed $300,000.

Find the number of American and British planes that were used to maximize cargo capacity.

21. A theater is presenting a program for students and their parents on drinking and driving. The proceeds will be donated to a local alcohol information center. Admission is $2.00 for parents and $1.00 for students. However, the situation has two constraints: The theater can hold no more than 150 people and every two parents must bring at least one student. How many parents and students should attend to raise the maximum amount of money?

M14_BLIT7240_06_SE_08-hr.indd 857 13/10/12 12:23 PM

Page 8: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

858 Chapter 8 Systems of Equations and Inequalities

22. You are about to take a test that contains computation problems worth 6 points each and word problems worth 10 points each. You can do a computation problem in 2 minutes and a word problem in 4 minutes. You have 40 minutes to take the test and may answer no more than 12 problems. Assuming you answer all the problems attempted correctly, how many of each type of problem must you answer to maximize your score? What is the maximum score?

23. In 1978, a ruling by the Civil Aeronautics Board allowed Federal Express to purchase larger aircraft. Federal Express’s options included 20 Boeing 727s that United Airlines was retiring and/or the French-built Dassault Fanjet Falcon 20. To aid in their decision, executives at Federal Express analyzed the following data:

Boeing 727 Falcon 20

Direct Operating Cost $1400 per hour $500 per hour

Payload 42,000 pounds 6000 pounds

Federal Express was faced with the following constraints: • Hourly operating cost was limited to $35,000. • Total payload had to be at least 672,000 pounds. • Only twenty 727s were available.

Given the constraints, how many of each kind of aircraft should Federal Express have purchased to maximize the number of aircraft?

Writing in Mathematics 24. What kinds of problems are solved using the linear

programming method? 25. What is an objective function in a linear programming

problem? 26. What is a constraint in a linear programming problem? How

is a constraint represented? 27. In your own words, describe how to solve a linear

programming problem. 28. Describe a situation in your life in which you would really

like to maximize something, but you are limited by at least two constraints. Can linear programming be used in this situation? Explain your answer.

Critical Thinking Exercises Make Sense? In Exercises 29–32, determine whether each statement makes sense or does not make sense, and explain your reasoning.

29. In order to solve a linear programming problem, I use the graph representing the constraints and the graph of the objective function.

30. I use the coordinates of each vertex from my graph representing the constraints to fi nd the values that maximize or minimize an objective function.

31. I need to be able to graph systems of linear inequalities in order to solve linear programming problems.

32. An important application of linear programming for businesses involves maximizing profi t.

33. Suppose that you inherit $10,000. The will states how you must invest the money. Some (or all) of the money must be invested in stocks and bonds. The requirements are that at least $3000 be invested in bonds, with expected returns of $0.08 per dollar, and at least $2000 be invested in stocks, with expected returns of $0.12 per dollar. Because the stocks are medium risk, the fi nal stipulation requires that the investment in bonds should never be less than the investment in stocks. How should the money be invested so as to maximize your expected returns?

34. Consider the objective function z = Ax + By (A 7 0 and B 7 0) subject to the following constraints: 2x + 3y … 9, x - y … 2, x Ú 0, and y Ú 0. Prove that the objective function will have the same maximum value at the vertices (3, 1) and (0, 3) if A = 2

3 B.

Group Exercises 35. Group members should choose a particular fi eld of interest.

Research how linear programming is used to solve problems in that fi eld. If possible, investigate the solution of a specifi c practical problem. Present a report on your fi ndings, including the contributions of George Dantzig, Narendra Karmarkar, and L. G. Khachion to linear programming.

36. Members of the group should interview a business executive who is in charge of deciding the product mix for a business. How are production policy decisions made? Are other methods used in conjunction with linear programming? What are these methods? What sort of academic background, particularly in mathematics, does this executive have? Present a group report addressing these questions, emphasizing the role of linear programming for the business.

Preview Exercises Exercises 37–39 will help you prepare for the material covered in the fi rst section of the next chapter.

37. Solve the system:

c x + y + 2z = 19y + 2z = 13

z = 5.

What makes it fairly easy to fi nd the solution? 38. Solve the system:

d w - x + 2y - 2z = -1x - 1

3 y + z = 83

y - z = 1z = 3.

Express the solution set in the form {(w, x, y, z)}. What makes it fairly easy to fi nd the solution?

39. Consider the following array of numbers:

J1 2 -14 -3 -15

R .

Rewrite the array as follows: Multiply each number in the top row by -4 and add this product to the corresponding number in the bottom row. Do not change the numbers in the top row.

M14_BLIT7240_06_SE_08-hr.indd 858 13/10/12 12:23 PM

Page 9: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Summary, Review, and Test 859

SUMMARY

DEFINITIONS AND CONCEPTS EXAMPLES

8.1 Systems of Linear Equations in Two Variables a. Two equations in the form Ax + By = C are called a system of linear equations. A solution of the system

is an ordered pair that satisfi es both equations in the system.

b. Systems of linear equations in two variables can be solved by eliminating a variable, using the substitution method (see the box on page 794 ) or the addition method (see the box on page 796 ).

c. Some linear systems have no solution and are called inconsistent systems; others have infi nitely many solutions. The equations in a linear system with infi nitely many solutions are called dependent. For details, see the box on page 798 .

d. Functions of Business

Revenue Function

R(x) = (price per unit sold)x Cost Function

C(x) = fixed cost + (cost per unit produced)x Profi t Function

P(x) = R(x) - C(x)

The point of intersection of the graphs of R and C is the break-even point. The x@coordinate of the point reveals the number of units that a company must produce and sell so that the money coming in, the revenue, is equal to the money going out, the cost. The y@coordinate gives the amount of money coming in and going out.

8.2 Systems of Linear Equations in Three Variables a. Three equations in the form Ax + By + Cz = D are called a system of linear equations in three variables.

A solution of the system is an ordered triple that satisfi es all three equations in the system.

b. A system of linear equations in three variables can be solved by eliminating variables. Use the addition method to eliminate any variable, reducing the system to two equations in two variables. Use substitution or the addition method to solve the resulting system in two variables. Details are found in the box on page 809 .

c. Three points that do not lie on a line determine the graph of a quadratic function y = ax2 + bx + c. Use the three given points to create a system of three equations. Solve the system to fi nd a, b, and c.

8.3 Partial Fractions a. Partial fraction decomposition is used on rational expressions in which the numerator and denominator

have no common factors and the highest power in the numerator is less than the highest power in the denominator. The steps in partial fraction decomposition are given in the box on page 819 .

b. Include one partial fraction with a constant numerator for each distinct linear factor in the denominator. Include one partial fraction with a constant numerator for each power of a repeated linear factor in the denominator.

c. Include one partial fraction with a linear numerator for each distinct prime quadratic factor in the denominator. Include one partial fraction with a linear numerator for each power of a prime, repeated quadratic factor in the denominator.

8.4 Systems of Nonlinear Equations in Two Variables a. A system of two nonlinear equations in two variables contains at least one equation that cannot be expressed

as Ax + By = C.

b. Systems of nonlinear equations in two variables can be solved algebraically by eliminating all occurrences of one of the variables by the substitution or addition methods.

Ex. 1, p. 792

Ex. 2, p. 794 ; Ex. 3, p. 796 ; Ex. 4, p. 797

Ex. 5, p. 798 ; Ex. 6, p. 799

Ex. 7, p. 800 ; Figure 8.7 , p. 802

Ex. 1, p. 808

Ex. 2, p. 809 ; Ex. 3, p. 811

Ex. 4, p. 812

Summary, Review, and Test CHAPTER 8

Ex. 1, p. 818 ; Ex. 2, p. 820

Ex. 3, p. 822 ; Ex. 4, p. 824

Ex. 1, p. 828 ; Ex. 2, p. 829 ; Ex. 3, p. 830 ; Ex. 4, p. 832

M14_BLIT7240_06_SE_08-hr.indd 859 13/10/12 12:23 PM

Page 10: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Talk about paintings by numbers: In 2007, this glittering Klimt set the record for the most ever paid for a painting, a title that had been held by Picasso’s Boy with a Pipe . Combined, the two paintings sold for $239 million. The difference between the selling price for Klimt’s work and the selling price for Picasso’s work was $31 million. Find the amount paid for each painting.

8. The music business is evolving into a digital marketplace. The bar graph shows that from 2004 through 2009, CD album sales declined, while digital track sales grew.

1400

1200

1000

800

600

400Sale

s (m

illio

ns)

Sales of Albums and Digital Tracksin the United States

2009

293

1237

Year20072004

511

868770

142200

CD album salesDigital track sales

Source : RIAA

a. In 2004, 142 million digital tracks were sold. For the period shown by the graph, this has increased at an average rate of 219 million digital tracks per year. Write a function that models the sale of digital tracks, y, in millions, x years after 2004.

b. The function 95x + y = 770 models the number of albums sold, y, in millions, x years after 2004. Use this model and the model you obtained in part (a) to determine when digital track sales caught up with album sales. How many digital tracks and how many albums were sold in that year?

8.5 Systems of Inequalities a. A linear inequality in two variables can be written in the form

Ax + By 7 C, Ax + By Ú C, Ax + By 6 C, or Ax + By … C.

b. The procedure for graphing a linear inequality in two variables is given in the box on page 839 . A nonlinear inequality in two variables is graphed using the same procedure.

c. To graph the solution set of a system of inequalities, graph each inequality in the system in the same rectangular coordinate system. Then fi nd the region, if there is one, that is common to every graph in the system.

8.6 Linear Programming a. An objective function is an algebraic expression in three variables describing a quantity that must be

maximized or minimized.

b. Constraints are restrictions, expressed as linear inequalities.

c. Linear programming is a method for solving problems in which an objective function that must be maximized or minimized is limited by constraints. Steps for solving a linear programming problem are given in the box on page 853 .

REVIEW EXERCISES

Ex. 1, p. 839 ; Ex. 2, p. 840 ; Ex. 3, p. 842 ; Ex. 4, p. 842 Ex. 6, p. 844 ; Ex. 7, p. 845 ; Ex. 8, p. 846

Ex. 1, p. 851

Ex. 2, p. 852 ; Ex. 3, p. 853

Ex. 4, p. 854 ; Ex. 5, p. 855

8.1 In Exercises 1–5, solve by the method of your choice. Identify systems with no solution and systems with infi nitely many solutions, using set notation to express their solution sets.

1. b y = 4x + 13x + 2y = 13

2. b x + 4y = 142x - y = 1

3. b 5x + 3y = 13x + 4y = -6

4. b 2y - 6x = 73x - y = 9

5. b 4x - 8y = 163x - 6y = 12

6. A company is planning to manufacture computer desks. The fi xed cost will be $60,000 and it will cost $200 to produce each desk. Each desk will be sold for $450.

a. Write the cost function, C, of producing x desks. b. Write the revenue function, R, from the sale of x desks. c. Determine the break-even point. Describe what this

means.

7.

Adele Bloch-Bauer, I (1907), Gustav Klimt/Neue Galerie/Art Resource, NY

Boy with a Pipe (1905), Pablo Picasso. © 2011 Picasso Estate/ARS

DEFINITIONS AND CONCEPTS EXAMPLES

860 Chapter 8 Systems of Equations and Inequalities

M14_BLIT7240_06_SE_08-hr.indd 860 13/10/12 12:23 PM

Page 11: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Summary, Review, and Test 861

18. 4x2 - 3x - 4

x(x + 2)(x - 1) 19.

2x + 1

(x - 2)2

20. 2x - 6

(x - 1)(x - 2)2 21. 3x

(x - 2)(x2 + 1)

22. 7x2 - 7x + 23

(x - 3)(x2 + 4) 23.

x3

(x2 + 4)2

24. 4x3 + 5x2 + 7x - 1

(x2 + x + 1)2

8.4 In Exercises 25–35, solve each system by the method of your choice.

25. b 5y = x2 - 1x - y = 1

26. b y = x2 + 2x + 1x + y = 1

27. b x2 + y2 = 2x + y = 0

28. b 2x2 + y2 = 24x2 + y2 = 15

29. b xy - 4 = 0y - x = 0

30. b y2 = 4xx - 2y + 3 = 0

31. b x2 + y2 = 10y = x + 2

32. b xy = 1y = 2x + 1

33. b x + y + 1 = 0x2 + y2 + 6y - x = -5

34. b x2 + y2 = 13x2 - y = 7

35. b 2x2 + 3y2 = 213x2 - 4y2 = 23

36. The perimeter of a rectangle is 26 meters and its area is 40 square meters. Find its dimensions.

37. Find the coordinates of all points (x, y) that lie on the line whose equation is 2x + y = 8, so that the area of the rectangle shown in the fi gure is 6 square units.

y

xx

y

(x, y)

2x + y = 8

38. Two adjoining square fi elds with an area of 2900 square feet are to be enclosed with 240 feet of fencing. The situation is represented in the fi gure. Find the length of each side where a variable appears.

xx

y

y

One Apple One Avocado

Calories 100 350

Carbohydrates (grams) 24 14

9. The perimeter of a rectangular table top is 34 feet. The difference between 4 times the length and 3 times the width is 33 feet. Find the dimensions.

10. A travel agent offers two package vacation plans. The fi rst plan costs $360 and includes 3 days at a hotel and a rental car for 2 days. The second plan costs $500 and includes 4 days at a hotel and a rental car for 3 days. The daily charge for the hotel is the same under each plan, as is the daily charge for the car. Find the cost per day for the hotel and for the car.

11. The calorie-nutrient information for an apple and an avocado is given in the table. How many of each should be eaten to get exactly 1000 calories and 100 grams of carbohydrates?

8.2 Solve each system in Exercises 12–13.

12. c 2x - y + z = 13x - 3y + 4z = 54x - 2y + 3z = 4

13. c x + 2y - z = 52x - y + 3z = 0

2y + z = 1

14. Find the quadratic function y = ax2 + bx + c whose graph passes through the points (1, 4), (3, 20), and (-2, 25).

15. 20th Century Death The greatest cause of death in the 20th century was disease, killing 1390 million people. The bar graph shows the fi ve leading causes of death in that century, excluding disease.

140

120

100

80

60

40

20

Num

ber

of D

eath

s(m

illio

ns)

Number of Deaths in the 20th Century, by Cause

Cause of DeathMurder

20

Suicide

70

Tobacco

z

Famine

y

War

x

Source : Wikipedia

War, famine, and tobacco combined resulted in 306 million deaths. The difference between the number of deaths from war and famine was 13 million. The difference between the number of deaths from war and tobacco was 53 million. Find the number of 20th century deaths from war, famine, and tobacco.

8.3 In Exercises 16–24, write the partial fraction decomposition of each rational expression.

16. x

(x - 3)(x + 2) 17.

11x - 2

x2 - x - 12

M14_BLIT7240_06_SE_08-hr.indd 861 13/10/12 12:23 PM

Page 12: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

Cutting Time per Tent

Assembly Time per Tent

Model A 0.9 hour 0.8 hour

Model B 1.8 hours 1.2 hours

CHAPTER 8 TEST In Exercises 1–5, solve the system.

1. b x = y + 43x + 7y = -18

2. b 2x + 5y = -23x - 4y = 20

3. c x + y + z = 63x + 4y - 7z = 12x - y + 3z = 5

4. b x2 + y2 = 25x + y = 1

5. b 2x2 - 5y2 = -23x2 + 2y2 = 35

6. Find the partial fraction decomposition for x

(x + 1)(x2 + 9).

8.5 In Exercises 39–45, graph each inequality.

39. 3x - 4y 7 12 40. y … - 12

x + 2

41. x 6 -2 42. y Ú 3 43. x2 + y2 7 4 44. y … x2 - 1 45. y … 2x

In Exercises 46–55, graph the solution set of each system of inequalities or indicate that the system has no solution.

46. b 3x + 2y Ú 62x + y Ú 6

47. b 2x - y Ú 4x + 2y 6 2

48. b y 6 xy … 2

49. b x + y … 6y Ú 2x - 3

50. b 0 … x … 3y 7 2

51. b 2x + y 6 42x + y 7 6

52. b x2 + y2 … 16x + y 6 2

53. b x2 + y2 … 9y 6 -3x + 1

54. c y 7 x2

x + y 6 6y 6 x + 6

55. c y Ú 03x + 2y Ú 4

x - y … 3

8.6 56. Find the value of the objective function z = 2x + 3y at each

corner of the graphed region shown. What is the maximum value of the objective function? What is the minimum value of the objective function?

y

x(q, q)

(2, 2)

(4, 0)

(1, 0)

In Exercises 57–59, graph the region determined by the constraints. Then fi nd the maximum value of the given objective function, subject to the constraints.

57. Objective Function Constraints

z = 2x + 3y

c x Ú 0, y Ú 0x + y … 8

3x + 2y Ú 6

58. Objective Function Constraints

z = x + 4y

b 0 … x … 5, 0 … y … 7x + y Ú 3

59. Objective Function Constraints

z = 5x + 6y

d x Ú 0, y Ú 0y … x2x + y … 122x + 3y Ú 6

60. A paper manufacturing company converts wood pulp to writing paper and newsprint. The profi t on a unit of writing paper is $500 and the profi t on a unit of newsprint is $350.

a. Let x represent the number of units of writing paper produced daily. Let y represent the number of units of newsprint produced daily. Write the objective function that models total daily profi t.

b. The manufacturer is bound by the following constraints: • Equipment in the factory allows for making at most 200

units of paper (writing paper and newsprint) in a day. • Regular customers require at least 10 units of writing

paper and at least 80 units of newsprint daily. Write a system of inequalities that models these constraints. c. Graph the inequalities in part (b). Use only the fi rst quadrant,

because x and y must both be positive. ( Suggestion: Let each unit along the x@ and y@axes represent 20.)

d. Evaluate the objective function at each of the three vertices of the graphed region.

e. Complete the missing portions of this statement: The company will make the greatest profi t by producing units of writing paper and units of newsprint each day. The maximum daily profi t is $ .

61. A manufacturer of lightweight tents makes two models whose specifi cations are given in the following table:

On a monthly basis, the manufacturer has no more than 864 hours of labor available in the cutting department and at most 672 hours in the assembly division. The profi ts come to $25 per tent for model A and $40 per tent for model B. How many of each should be manufactured monthly to maximize the profi t?

862 Chapter 8 Systems of Equations and Inequalities

M14_BLIT7240_06_SE_08-hr.indd 862 13/10/12 12:23 PM

Page 13: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

In Exercises 7–10, graph the solution set of each inequality or system of inequalities.

7. x - 2y 6 8 8. c x Ú 0, y Ú 03x + y … 92x + 3y Ú 6

9. b x2 + y2 7 1x2 + y2 6 4

10. b y … 1 - x2

x2 + y2 … 9

11. Find the maximum value of the objective function z = 3x + 5y subject to the following constraints: x Ú 0, y Ú 0, x + y … 6, x Ú 2.

12. Health experts agree that cholesterol intake should be limited to 300 mg or less each day. Three ounces of shrimp and 2 ounces of scallops contain 156 mg of cholesterol. Five ounces of shrimp and 3 ounces of scallops contain 45 mg of cholesterol less than the suggested maximum daily intake. Determine the cholesterol content in an ounce of each item.

13. A company is planning to produce and sell a new line of computers. The fi xed cost will be $360,000 and it will cost $850 to produce each computer. Each computer will be sold for $1150.

a. Write the cost function, C, of producing x computers. b. Write the revenue function, R, from the sale of x

computers. c. Determine the break-even point. Describe what this

means.

14. Find the quadratic function whose graph passes through the points (-1, -2), (2, 1), and (-2, 1).

15. The rectangular plot of land shown in the fi gure is to be fenced along three sides using 39 feet of fencing. No fencing is to be placed along the river’s edge. The area of the plot is 180 square feet. What are its dimensions?

y

x

x

16. A manufacturer makes two types of jet skis, regular and deluxe. The profi t on a regular jet ski is $200 and the profi t on the deluxe model is $250. To meet customer demand, the company must manufacture at least 50 regular jet skis per week and at least 75 deluxe models. To maintain high quality, the total number of both models of jet skis manufactured by the company should not exceed 150 per week. How many jet skis of each type should be manufactured per week to obtain maximum profi t? What is the maximum weekly profi t?

CUMULATIVE REVIEW EXERCISES (CHAPTERS 1–8)

The fi gure shows the graph of y = f(x) and its two vertical asymptotes. Use the graph to solve Exercises 1–10.

−1

1234

−2−3−4

1 2−1−2

y

x

y = f(x)

1. Find the domain and the range of f. 2. Find the zeros. 3. What is the relative maximum and where does it occur? 4. Find the interval(s) on which f is decreasing. 5. Is f(-0.7) positive or negative? 6. Find (f � f)(-1). 7. Use arrow notation to complete this statement:

f(x) S -� as or as . 8. Does f appear to be even, odd, or neither? 9. Graph g(x) = f(x + 2) - 1. 10. Graph h(x) = 1

2 f112 x2.

In Exercises 11–21, solve each equation, inequality, or system of equations.

11. 2x2 - 3x = 2x - 6 12. 4x2 = 8x - 7

13. ̀x3

+ 2 ` 6 4 14. x + 5x - 1

7 2

15. 2x3 + x2 - 13x + 6 = 0 16. 6x - 3(5x + 2) = 4(1 - x)

17. log(x + 3) + log x = 1 18. 3x+2 = 11

19. x

12

- 2x

14

- 15 = 0 20. b 3x - y = -22x2 - y = 0

21. c x + 2y + 3z = -23x + 3y + 10z = -2

2y - 5z = 6

In Exercises 22–28, graph each equation, function, or inequality in a rectangular coordinate system. If two functions are indicated, graph both in the same system.

22. f(x) = (x + 2)2 - 4 23. 2x - 3y … 6

24. y = 3x-2 25. f(x) =x2 - x - 6

x + 1

26. f(x) = 2x - 4 and f -1

27. (x - 2)2 + (y - 4)2 7 9

28. f(x) = � x � and g(x) = - � x - 2 �

Summary, Review, and Test 863

M14_BLIT7240_06_SE_08-hr.indd 863 13/10/12 12:23 PM

Page 14: SECTION 8.6 Linear Programming - MR. THOMPSON...Section 8.6 Linear Programming 851 T he Berlin Airlift (1948–1949) was an operation by the United States and Great Britain in response

864 Chapter 8 Systems of Equations and Inequalities

In Exercises 29–30, let f(x) = 2x2 - x - 1 and g(x) = 1 - x.

29. Find (f � g)(x) and (g � f)(x).

30. Find f(x + h) - f(x)

h and simplify.

In Exercises 31–32, write the linear function in slope-intercept form satisfying the given conditions.

31. Graph of f passes through (2, 4) and (4, -2). 32. Graph of g passes through (-1, 0) and is perpendicular to the

line whose equation is x + 3y - 6 = 0. 33. You invested $4000 in two investments paying 12% and 14%

annual interest. At the end of the year, the total interest from these investments was $508. How much was invested at each rate?

34. The length of a rectangle is 1 meter more than twice the width. If the rectangle’s area is 36 square meters, fi nd its dimensions.

35. What interest rate is required for an investment of $6000 subject to continuous compounding to grow to $18,000 in 10 years?

In Exercises 36–37, verify each identity.

36. sec u - cos u = tan u sin u

37. tan x + tan y =sin(x + y)

cos x cos y

In Exercises 38–39, solve each equation.

38. sin u = tan u, 0 … u 6 2p

39. 2 + cos 2u = 3 cos u, 0 … u 6 2p

40. In oblique triangle ABC, A = 12�, B = 75�, and a = 20. Find b to the nearest tenth.

M14_BLIT7240_06_SE_08-hr.indd 864 13/10/12 12:23 PM