Problem (Algorithmic)
Kilgore's Deli is a small delicatessen located near a major university. Kilgore's does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes).
The profit on one serving of Wimpy is $0.35, on one serving of Dial 911, $0.52. Each serving of Wimpy requires 0.25 pound of beef, 0.25 cup of onions, and 5 ounces of Kilgore's special sauce.
Each serving of Dial 911 requires 0.25 pound of beef, 0.4 cup of onions, 1 ounces of Kilgore's special sauce, and 5 ounces of hot sauce. Today, Kilgore has 15 pounds of beef, 20 cups of onions, 67 ounces of Kilgore's special sauce, and 65 ounces of hot sauce on hand.
Develop an LP model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today.
| Let |
|
|
W = # of servings of Wimpy to make |
|
D = # of servings of Dial 911 to make |
| Max |
W |
+ |
D |
|
|
|
| s.t. |
|
|
|
|
|
|
|
W |
+ |
D |
= |
|
(Beef) |
|
W |
+ |
D |
= |
|
(Onions) |
|
W |
+ |
D |
= |
|
(Special Sauce) |
|
|
|
D |
= |
|
(Hot Sauce) |
|
|
|
W, D |
= |
0 |
|
Find an optimal solution. Round the answer for profit to the nearest cent and, if required, round the answers for W and D to one decimal place.
Solution: W = , D = , Profit = $
What is the dual value for special sauce? Round your answer to the nearest cent.
Dual value for special sauce = $
Increase the amount of special sauce available by 1 ounce. Give the new solution. Round the answer for profit to the nearest cent.
Solution: W = , D = , Profit = $
Does the solution confim the answer to part (c)?