Question

Kilgore’s Deli is a small delicatessen located near a major university. Kilgore’s does a large walk-in...

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.4, on one serving of Dial 911, $0.53. Each serving of Wimpy requires 0.2 pound of beef, 0.2 cup of onions, and 5 ounces of Kilgore’s special sauce. Each serving of Dial 911 requires 0.2 pound of beef, 0.35 cup of onions, 2 ounces of Kilgore’s special sauce, and 5 ounces of hot sauce. Today, Kilgore has 15 pounds of beef, 10 cups of onions, 84 ounces of Kilgore’s special sauce, and 55 ounces of hot sauce on hand.

Develop a linear programming model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today. If required, round your answers to two decimal places. For subtractive or negative numbers use a minus sign even if there is a + sign before the blank. (Example: -300)

Let W = number of servings of Wimpy to make
D = number of servings of Dial 911 to make
Max W + D
s.t.
W + D ? (Beef)
W + D ? (Onions)
W + D ? (Special Sauce)
W + D ? (Hot Sauce)
W, D ? 0

Find an optimal solution. If required, round your answers to two decimal places.

W = , D = , Profit = $  

What is the shadow price for special sauce? If required, round your answers to two decimal places.

$  

Interpret the shadow price.

The input in the box below will not be graded, but may be reviewed and considered by your instructor.


Increase the amount of special sauce available by 1 ounce and re-solve. If required, round your answers to two decimal places.

W = , D = , Profit = $  

Does the solution confirm the answer to part (c)?

Yes, as the shadow price is confirmed.

Homework Answers

Answer #1

(a) Linear Programming model is following

Max 0.4W + 0.53D

s.t.

0.2W + 0.2D <= 15

0.2W + 0.35D <= 10

5W + 2D <= 84

5D <= 55

W, D >= 0

(b) Solution using Solver follows

Formula: D2 =SUMPRODUCT(B2:C2,$B$9:$C$9)   copy to D4:D7

Solution: W = 12.4, D = 11, Profit = $ 10.79

(c) Refer sensitivity report, Shadow price for special sauce is 0.08

Interpretation of shadow price is that every additional ounce of special sauce will increase the total profit by $ 0.08

(d) Resolving the problem by increasing the special sauce by 1 ounce, we get following result,

Increase in profit = 10.87 - 10.79 = 0.08

Therefore, the solution confirms the shadow price.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Problem 9-05 (Algorithmic) Kilgore’s Deli is a small delicatessen located near a major university. Kilgore’s does...
Problem 9-05 (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.4, on one serving of Dial 911, $0.53. Each serving of Wimpy requires 0.2...
Problem 9-05 (Algorithmic) Kilgore's Deli is a small delicatessen located near a major university. Kilgore's does...
Problem 9-05 (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.46, on one serving of Dial 911, $0.59. Each serving of Wimpy requires 0.26...
LP Graphical Method Problems 1) MAXIMIZATION PROBLEM - 4 PTS Objective Function: Maximize Profit: 5X +...
LP Graphical Method Problems 1) MAXIMIZATION PROBLEM - 4 PTS Objective Function: Maximize Profit: 5X + 3Y Subject to the constraints: 5 X + 2 Y ≤ 40 3 X + 6 Y ≤ 48 X ≤ 7 2 X − Y ≥ 3 X , Y ≥ 0 ******* 2) MINIMIZATION PROBLEM - 4 PTS Objective function: Minimize Cost: 3X + 7Y Subject to the constraints: 9 X + 3 Y ≥ 36 4 X + 5 Y ≥...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT