Linear Programming: More Word Problems (page 4 of 5) Sections: Optimizing linear systems, Setting up word problems
Rather than order rabbit food that is customblended, 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 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 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. Sometimes you'll have more than just two things to deal with. The next example has three things to juggle; the next page provides an example of juggling four things.
Since the question is asking me to find the amount of money for each account, my variables will need to stand for those amounts. Since I'd like to deal with smaller numbers, I'll count by thousands, so: x:
amount (in thousands) invested in bonds Um... now what? I only have two variables, but I have three accounts. To handle this, I need the "how much is left" construction: 12 – x – y: amount (in thousands) invested in the highrisk account I can't invest negative amounts of money, so the first two constraints are the usual ones: x > 0 and y > 0. The amount in the highrisk account can't be negative either, so 12 – x – y > 0, which simplifies as: y < –x + 12 Also, the upper limit on the highrisk account gives me the inequality (12 – x – y) < 2. This simplifies as: Copyright © Elizabeth Stapel 20062011 All Rights Reserved y > –x + 10 And the tax requirements give me y < ( ^{1}/_{3} )x. The optimization equation will be the total investment yield, Y = 0.07x + 0.08y + 0.12(12 – x – y) = 1.44 – 0.05x – 0.04y. The entire system is then as follows: Maximize Y
= 1.44 – 0.05x – 0.04y,
subject to: The feasibility region graphs as: When you test the corner points at (9, 3), (12, 0), (10, 0), and (7.5, 2.5), you should get an optimal return of $965 when you invest $7,500 in municipal bonds, $2,500 in CDs, and the remaining $2,000 in the highrisk account. << Previous Top  1  2  3  4  5  Return to Index Next >>



Copyright © 20062012 Elizabeth Stapel  About  Terms of Use 




