0% found this document useful (0 votes)
295 views

Linear Programming WS II

The document contains 4 word problems involving linear programming. The first problem involves maximizing storage volume when buying filing cabinets within a budget and space constraint. The optimal solution is to buy 8 of cabinet X and 3 of cabinet Y to obtain a maximum volume of 100 cubic feet. The second problem involves maximizing profit from selling hamburgers and hot dogs within cooking limits, selling requirements, and profit margins. The third problem involves minimizing the daily cost of an optimal blend of rabbit foods to meet dietary requirements within a weight limit. The optimal blend is 3 ounces of food X. The fourth problem involves maximizing test score by answering types of questions within limits, where the maximum score is obtained by answering 4 of type A and 3 of type

Uploaded by

cmnell
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
295 views

Linear Programming WS II

The document contains 4 word problems involving linear programming. The first problem involves maximizing storage volume when buying filing cabinets within a budget and space constraint. The optimal solution is to buy 8 of cabinet X and 3 of cabinet Y to obtain a maximum volume of 100 cubic feet. The second problem involves maximizing profit from selling hamburgers and hot dogs within cooking limits, selling requirements, and profit margins. The third problem involves minimizing the daily cost of an optimal blend of rabbit foods to meet dietary requirements within a weight limit. The optimal blend is 3 ounces of food X. The fourth problem involves maximizing test score by answering types of questions within limits, where the maximum score is obtained by answering 4 of type A and 3 of type

Uploaded by

cmnell
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Honors Algebra II

Linear Programming Word Problems Worksheet II

1) You need to buy some filing cabinets. You know that Cabinet X costs $10 per unit, requires six square feet of
floor space, and holds eight cubic feet of files. Cabinet Y costs $20 per unit, requires eight square feet of floor
space, and holds twelve cubic feet of files. You have been given $140 for this purchase, though you don't have
to spend that much. The office has room for no more than 72 square feet of cabinets. How many of which
model should you buy, in order to maximize storage volume?

2) A snack bar cooks and sells hamburgers and hot dogs during football games. To stay in business, it must sell at
least 10 hamburgers but can not cook more than 40. It must also sell at least 30 hot dogs, but can not cook more
than 70. The snack bar can not cook more than 90 items total. The profit on a hamburger is 33 cents, and the
profit on a hot dog is 21 cents. Low many of each item should it sell to make the maximum profit?
3) In order to ensure optimal health (and thus accurate test results), a lab technician needs to feed the rabbits a
daily diet containing a minimum of 24 grams (g) of fat, 36 g of carbohydrates, and 4 g of protein. But the
rabbits should be fed no more than five ounces of food a day. Rather than order rabbit food that is custom-
blended, it is cheaper to order Food X and Food Y, and blend them for an optimal mix. Food X contains 8 g of
fat, 12 g of carbohydrates, and 2 g of protein per ounce, and costs $0.20 per ounce. Food Y contains 12 g of fat,
12 g of carbohydrates, and 1 g of protein per ounce, at a cost of $0.30 per ounce. What is the optimal blend of
Food X and Food Y?

4) You are about to take a test that contains questions of type A worth 4 points and type B worth 7 points. You
must answer at least 4 of type A and 3 of type B, but time restricts answering more than 10 of either type. In
total, you can answer no more than 18. How many of each type of question must you answer, assuming all of
your answers are correct, to maximize your score? What is your maximum score?
• You need to buy some filing cabinets. You know that Cabinet X costs $10 per unit, requires six square feet of
floor space, and holds eight cubic feet of files. Cabinet Y costs $20 per unit, requires eight square feet of floor
space, and holds twelve cubic feet of files. You have been given $140 for this purchase, though you don't have to
spend that much. The office has room for no more than 72 square feet of cabinets. How many of which model
should you buy, in order to maximize storage volume?

The question ask for the number of cabinets I need to buy, so my variables will stand for that:

x: number of model X cabinets purchased


y: number of model Y cabinets purchased

Naturally, x > 0 and y > 0. I have to consider costs and floor space (the "footprint" of each unit), while maximizing the
storage volume, so costs and floor space will be my constraints, while volume will be my optimization equation.

cost: 10x + 20y < 140, or y < –( 1/2 )x + 7


space: 6x + 8y < 72, or y < –( 3/4 )x + 9
volume: V = 8x + 12y

This system (along with the first two constraints) graphs as:

When you test the corner points at (8, 3), (0, 7), and (12, 0), you should obtain a maximal volume of100 cubic feet by buying
eight of model X and three of model Y.
• In order to ensure optimal health (and thus accurate test results), a lab technician needs to feed the rabbits a
daily diet containing a minimum of 24 grams (g) of fat, 36 g of carbohydrates, and 4 g of protien. But the rabbits
should be fed no more than five ounces of food a day.

Rather than order rabbit food that is custom-blended, it is cheaper to order Food X and Food Y, and blend them
for an optimal mix. Food X contains 8 g of fat, 12 g of carbohydrates, and 2 g of protein per ounce, and costs
$0.20 per ounce. Food Y contains 12 g of fat, 12 g of carbohydrates, and 1 g of protein per ounce, at a cost of
$0.30 per ounce.

What is the optimal blend?

Since the exercise is asking for the number of ounces of each food required for the optimal daily blend, my variables will
stand for the number of ounces of each:

x: number of ounces of Food X


y: number of ounces of Food Y

Since I can't use negative amounts of either food, the first two constrains are the usual ones: x > 0 and y > 0. The other
constraints come from the grams of fat, carbohydrates, and protein per ounce:

fat: 8x + 12y > 24


carbs: 12x + 12y > 36
protein: 2x + 1y > 4

Also, the maximum weight of the food is five ounces, so:


x+y<5

The optimization equation will be the cost relation C = 0.2x + 0.3y, but this time I'll be finding the minimum value, not the
maximum.

After rearranging the inequalities, the system graphs as:

(Note: One of the lines above is irrelevant to the system. Can you tell which one?)
When you test the corners at (0, 4), (0, 5), (3, 0), (5, 0), and (1, 2), you should get a minimum cost of sixty cents per daily
serving, using three ounces of Food X only.

You might also like