Problem 4-05 (Algorithmic) FOLLOW THE FORMAT. THANK YOU!

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.35, on one serving of Dial 911, $0.59. Each serving of Wimpy requires 0.45 pound of beef, 0.45 cup of onions, and 5 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.45 pound of beef, 0.72 cup of onions, 1 ounces of Kilgore's special sauce, and 4 ounces of hot sauce. Today, Kilgore has 27 pounds of beef, 36 cups of onions, 82 ounces of Kilgore's special sauce, and 52 ounces of hot sauce on hand.

a. 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 + + W D (Beef) (Onions) (Special Sauce) (Hot Sauce) W D D W, D 0 b. Find an optimal solution. Truncate your answers to whole servings available for sale. Solution: W = What is the optimal profit? Round your answer to the nearest cent. Profit = $ c. What is the dual value for special sauce? Round your answer to the nearest cent. Dual value for special sauce = $ d. 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 confirm the answer to part (c)