Question

In: Operations Management

. Input the Restaurant menu problem into your generic linear programming spreadsheet and confirm the solution...

. Input the Restaurant menu problem into your generic linear programming spreadsheet and confirm the solution given (or prove it wrong).

How Do Restaurants Use Linear Programming for Menu Planning?

Linear algebra helps restaurants earn a profit.

Restaurants use linear programming for menu planning. It uses basic algebra to optimize meal production and thereby increase restaurant profits. Linear algebra reflects a direct relationship between an increase or decrease in food resources, and an increase or decrease in meal production. For example, if the kitchen has only half its needed supply of cream base, then it can only prepare half its normal amount of cream soups. Additionally, management can determine the cost of preparing different menu items to decide how many of each menu item to prepare for optimal profit.

Weekly Meal Planner

Step 1

Choose the decision variables that apply. In this example, a restaurant needs to produce 250 of its dinner specials per day, one with meat and the other vegetarian. The decision variables are the number of meals and the different menu names (i.e., porterhouse steak and spinach lasagna).

Step 2

Choose the objective for the restaurant. Normally, the objective is to determine how many of each menu item to prepare that meets the required number of meals yet stays within budget, so this is the objective for the example shown. However, the objective will be the quantity of physical supplies on hand, if there is a shortage of a particular ingredient that several menu items use, such as tomato sauce. Then management can determine how to get the largest number of meals with the quantity of tomato sauce on hand.

Step 3

Choose the constraints on menu production, which is the day’s monetary budget to produce a specified number of meals. For example, a restaurant has a $1,000 budget for that day’s two dinner specials, and it must prepare 250 meals that cost different amounts to prepare. It cannot spend more than $1,000 and still earn a profit.

Step 4

Choose the two dinner specials, such as porterhouse steak and spinach lasagna. For this example, the porterhouse steak costs $7 to prepare and the lasagna dinner costs $3. The steak is designated as “S” and the lasagna as “L."

Step 5

Calculate how many steak dinners the restaurant can prepare for $1,000: S + L = 250 meals. 7S <= $1,000 S <= $1,000 / 7 = 142.85 S = 142 meals for $1,000 (The restaurant cannot serve 85/100 of a meal, so that amount is dropped.)

Step 6

Calculate how many lasagna dinners the restaurant can prepare for $1,000. 3L <= $1,000 L <= $1,000 / 3 = 333.33 L = 333 meals for $1,000

Step 7

Calculate the ratio: 142S divided by 333L = 42 percent (drop the decimals). This means that 42 percent of the meals should be steak dinners. Conversely, 58 percent of the dinner specials should be spinach lasagna.

Step 8

Calculate the number of steak dinners the restaurant can prepare on its budget: 142S times 42 percent = 59 steak dinners (drop the decimals)

Step 9

Calculate the number of spinach lasagna dinners the restaurant can prepare on its budget: 333L times 58 percent = 193 lasagna dinners.

Step 10

Verify the quantity of meals: 59 steak dinners plus 193 lasagna dinners = 252 meals. Since the restaurant only has to prepare 250 meals, it is under budget, which means increased profit.

Step 11

Verify the cost: 59 steak dinners times $7 equals $413. 193 lasagna dinners times $3 equals $579. $413 + $579 = $992, which is under budget.

Solutions

Expert Solution

Hi,

First of all, the step 2 (Objective function) is not the correct approach. Objective function is not the number or quantity of meals. Objective function is either maximization or minimization problem.

Secondly the step 5 to 8 is irrelevant. The only constraints that are mentioned is that the total budget should be under $1000 and must prepare minimum 250 meals. With that logic the simplest calculation is to discard the more costly meal and prepare the cheaper (Lasagna) meal altogether. This means preparing 333 Lasagna meal will cost $999 you can maximize the number of people served.

Using the spreadsheet modeling technique gives the same story.


Related Solutions

The optimal solution of the linear programming problem is at the intersection of constraints 1 and...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis. Max s.t. Max 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12 1x1 +2x2 ≤6 x1 , x2 ≥ 0 Over what range can the coefficient of x1 vary before the current solution is no longer optimal? Over what range can the coefficient of x2 vary before the current solution is no...
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution...
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution below the problem. Max Z = 20X1 + 30X2 + 25X3 + 32X4 s.t. 4X1 + 8X2 + 5X3 + 6X4 ≤ 40 X1 + X2 ≥ 3 (X1 + X2) ≤ (X3 + X4) ?1 ?2 ≥ 3 2 X1 = __________ X2 = ___________ X3 = ___________ X4 = ___________ Z = ____________
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution...
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution below the problem. Max Z = 20X1 + 30X2 + 25X3 + 32X4 s.t. 4X1 + 8X2 + 5X3 + 6X4 ≤ 40 X1 + X2 ≥ 3 (X1 + X2) ≤ (X3 + X4) x1/x2 ≥ 3/2 X1 = __________X2 = ___________X3 = ___________X4 = ___________Z = ____________
For the following linear programming problem, determine the optimal solution by the graphical solution method Max...
For the following linear programming problem, determine the optimal solution by the graphical solution method Max -x + 2y s.t. 6x - 2y <= 3 -2x + 3y <= 6     x +   y <= 3         x, y >= 0
What is the difference between the optimal solution to a linear programming problem and the objective...
What is the difference between the optimal solution to a linear programming problem and the objective function value at the optimal solution? Use an example in your explanation
1. The optimal solution of the linear programming problem is at the intersection of constraints 1...
1. The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis. Max 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12   1x1 +2x2 ≤6 x1 , x2 ≥ 0 A. Over what range can the coefficient of x1 vary before the current solution is no longer optimal? B. Over what range can the coefficient of x2 vary before the current solution is...
Distinguish between basic feasible solution, feasible solution and optimal solution of a linear programming problem. Solve...
Distinguish between basic feasible solution, feasible solution and optimal solution of a linear programming problem. Solve the following LPP graphically: Y=q1+4q2 Subject to 2q1+6q2<=36 2q1+2q2<=16 4q1+2q2<=28 q1,q2>=0
Use the graphical method for linear programming to find the optimal solution for the following problem....
Use the graphical method for linear programming to find the optimal solution for the following problem. Maximize P = 4x + 5 y subject to 2x + 4y ≤ 12                 5x + 2y ≤ 10 and      x ≥ 0, y ≥ 0. graph the feasible region
What's the optimal solution to this linear programming problem? Max 2X + 3Y s.t.   4X +  ...
What's the optimal solution to this linear programming problem? Max 2X + 3Y s.t.   4X +   9Y ≤ 72 10X + 11Y ≤ 110 17X +   9Y ≤ 153           X, Y ≥ 0
Consider the following linear programming problem, and find the solution graphically in excel.                         Maximize &nbs
Consider the following linear programming problem, and find the solution graphically in excel.                         Maximize                     4X + 10Y                         Subject to:                    3X + 4Y <= 480                                                             4X + 2Y <= 360                                                             2X + 3Y >= 90                                                             all variables >= 0
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT