Scribd
Upload
37 views12 pages

Cell Name Original Value Final Value

The document describes a linear programming problem to maximize profits for a restaurant by determining the optimal number of beef and fish dinners to serve each night. It provides the original and final values of the objective cell and adjustable cells, as well as the constraints and their statuses. The problem is to determine how many beef and fish dinners to serve given constraints on the total number of dinners, labor hours, and the ratio of beef to fish dinners sold. The optimal solution is to serve 12 beef dinners and 48 fish dinners for a maximum profit of $768.

Uploaded by

katariamanoj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
37 views12 pages

Cell Name Original Value Final Value

The document describes a linear programming problem to maximize profits for a restaurant by determining the optimal number of beef and fish dinners to serve each night. It provides the original and final values of the objective cell and adjustable cells, as well as the constraints and their statuses. The problem is to determine how many beef and fish dinners to serve given constraints on the total number of dinners, labor hours, and the ratio of beef to fish dinners sold. The optimal solution is to serve 12 beef dinners and 48 fish dinners for a maximum profit of $768.

Uploaded by

katariamanoj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 12

Microsoft Excel 12.

0 Answer Report
Worksheet: [dinners.xls]Model and Solution
Report Created: 12/15/2009 10:57:55 AM

Target Cell (Max)


Cell
Name
$C$17 Max_Profit

Original Value
744

Final Value
768

Adjustable Cells
Cell
Name
$A$18 Beef_Dinners
$B$18 Fish_Dinners

Original Value
6
54

Final Value
12
48

Constraints
Cell
Name
$C$19 Total_Dinners
$C$20 Labor_Hours_Used
$C$22
$C$21
$A$18 Beef_Dinners
$B$18 Fish_Dinners

Cell Value
60
18
-30
-4.764189E-012
12
48

Formula
$C$19<=$D$19
$C$20<=$D$20
$C$22<=$D$22
$C$21=$D$21
$A$18=integer
$B$18=integer

Status
Binding
Not Binding
Not Binding
Not Binding
Binding
Binding

Slack
0
2
30
0
0
0

Problem:

could not offer a full menu of dishes.Decided to serve two-full course meals each night,one with beef and one with fish.Che

Decision Variables: Let x beef-dinners and y fish-dinners be planned


Objective Function:

Maximize z = 16x + 12y

Constraints:
x + y 60
0.5x + 0.25y 20
x = 0.2(x + y), that is 0.8x - 0.2y = 0
2y 3x, that is y 1.5x or 1.5x - y 0
x, y 0 and Integers
Solution:
16
12
1
0.5
0.8
1.5

12
48
1
0.25
-0.2
-1

768
60
18
-5E-012
-30

60
20
0
0

Optimal Solution:
6 beef-dinners and 54 fish-dinners must be planned; Maximum profit = $960.

ef and one with fish.Chefwas confident he could make each dish unique,two meals would be sufficient,at least until I assessed which m

until I assessed which menu items were popular.I indicated that with each meal he could experiment with different appetizers, soups, s

rent appetizers, soups, salads, vegetable dishes, and desserts until I identified a full selection of menu items.Next problem I was to det

ext problem I was to determine how many meals to prepare for each night so we could shop for ingredients & set up the work schedule

set up the work schedule.I could not afford too much waste.I estimated we would sell a maximum of 60 meals each night.Each fish din

s each night.Each fish dinner,&all accompaniment requires 15 minutes to prepare, and each beef dinner takes twice as long.Total of 20 h

wice as long.Total of 20 hours of staff labor available each day. will sell at least three fish dinners for every two beef dinners.10%of cus

beef dinners.10%of customers will order beef.Profit beef=$16,Fish $12.Need linear programming model for #meals toprepare nightly

meals toprepare nightly

You might also like