Scribd
Upload
86 views3 pages

Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease

This sensitivity report summarizes the optimal solution to a linear programming problem with 3 adjustable cells (X1, X2, X3) and 4 constraints. The report shows the final values and allowable increases/decreases for the adjustable cells and constraints. The optimal solution is to make 0 units of X1, 10 units of X2, and 10 units of X3, for a maximum total profit of $2,220.

Uploaded by

Mahad Ahmed
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
86 views3 pages

Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease

This sensitivity report summarizes the optimal solution to a linear programming problem with 3 adjustable cells (X1, X2, X3) and 4 constraints. The report shows the final values and allowable increases/decreases for the adjustable cells and constraints. The optimal solution is to make 0 units of X1, 10 units of X2, and 10 units of X3, for a maximum total profit of $2,220.

Uploaded by

Mahad Ahmed
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Microsoft Excel 12.

0 Sensitivity Report
Worksheet: [Excel solver.xlsx]LP Template
Report Created: 02/11/2010 09:51:31

Adjustable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$A$11 X1 272.7 0.0 4 16 0.5
$B$11 X2 90.9 0.0 5 0.3333333333 0.2307692308
$C$11 X3 36.4 0.0 8 0.375 1

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$12 Used 1000.00 0.00 1000 1E+030 0
$D$12 Used 1000.00 1.45 1000 0 80
$D$13 Used 581.82 0.00 1400 1E+030 818.18181818
$D$14 Used 1800.00 0.09 1800 333.33333334 400
$D$15 Used 400.00 0.55 400 25 38.461538462
A B C D E
1 Make X1 units of Regular Machine
2 Make X2 units of Deluxe Machine
3 Make X3 units of Super Machine
4

5 X1 X2 X3
6 0.0 10.0 10.0 Used Available
7 3000 5000 10000 150000.00 180000
8 15 20 30 500.00 500
9 1 2 5 70.00 100
10 -0.5 0.5 -0.5 0.00 0
11

12 Unit Profits Total Profit


13 36 42 180 2220.00
14

15 Solution:
16 Make 0.0 units of X1
17 Make 10.0 units of X2
18 Make 10.0 units of X3
19 Maximum total profit = 2220.00
20
F G H I J
1

7 Resource 1: 3000X1 + 5000X2 + 10000X3 <=18000


8 Resource 2: 15X1+20X2 + 30X3 <=500
9 Resource 3: X1 +2 X2 + 5X3 <=100
10 Resource 4: -0.5X1 + 0.5X2 -0.5 X3 =>0
11

12

13

14

15

16

17

18

19

20

You might also like