Kilgore's Deli is a small delicatessen located near a major university. Kilgore 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.44, on one serving of Dial $0.57. 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, 2 unces of Kilgore's special sauce, and 5 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. (a) 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. (Let W = the number of servings of Win make and let D = the number of servings of Dial 911 to make.) Max s.t. Beef Onions Special Sauce Hot Sauce W, D 20 (b) Find an optimal solution. (Round your answers to two decimal places.) (W, D) = Profit = $ (c) What is the dual value for special sauce? (Round your answer to two decimal places.) $ Interpret the dual value. For every 1 ounce increase in --Select--- , the profit will ---Select--- F -Select--- by $

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter11: Simulation Models
Section: Chapter Questions
Problem 47P
icon
Related questions
Question
A linear programming computer package is needed.
Kilgore's Deli is a small delicatessen located near a major university. Kilgore 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.44, on one serving of Dial 911,
$0.57. 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, 2
ounces of Kilgore's special sauce, and 5 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand.
(a) 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. (Let W = the number of servings of Wimpy t
make and let D = the number of servings of Dial 911 to make.)
Max
s.t.
Onions
Beef
Special Sauce
Hot Sauce
W, D ≥ 0
(b) Find an optimal solution. (Round your answers to two decimal places.)
(W, D) =
Profit =
$
(c) What is the dual value for special sauce? (Round your answer to two decimal places.)
$
Interpret the dual value.
For every 1 ounce increase in ---Select---
Profit =
(d) Increase the amount of special sauce available by 1 ounce and re-solve. (Round your answers to two decimal places.)
(W, D) =
$
the profit will ---Select--- by $
Does the solution confirm the answer to part (c)?
Yes
No
Need Help? Read It
Show My Work (Optional)?
Transcribed Image Text:A linear programming computer package is needed. Kilgore's Deli is a small delicatessen located near a major university. Kilgore 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.44, on one serving of Dial 911, $0.57. 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, 2 ounces of Kilgore's special sauce, and 5 ounces of hot sauce. Today, Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. (a) 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. (Let W = the number of servings of Wimpy t make and let D = the number of servings of Dial 911 to make.) Max s.t. Onions Beef Special Sauce Hot Sauce W, D ≥ 0 (b) Find an optimal solution. (Round your answers to two decimal places.) (W, D) = Profit = $ (c) What is the dual value for special sauce? (Round your answer to two decimal places.) $ Interpret the dual value. For every 1 ounce increase in ---Select--- Profit = (d) Increase the amount of special sauce available by 1 ounce and re-solve. (Round your answers to two decimal places.) (W, D) = $ the profit will ---Select--- by $ Does the solution confirm the answer to part (c)? Yes No Need Help? Read It Show My Work (Optional)?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 4 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,