Scribd
Upload
41 views4 pages

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

This document summarizes the results of a sensitivity analysis performed on a spreadsheet optimization model. It lists the variable cells in the model along with their final values, contribution to the objective function, and allowable increases and decreases. It also lists the constraints in the model along with their final shadow prices and allowable increases to the right-hand sides. The original optimal solution was 61600 and it did not change after perturbing the model.

Uploaded by

Vinit
Copyright
© © All Rights Reserved
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
41 views4 pages

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

This document summarizes the results of a sensitivity analysis performed on a spreadsheet optimization model. It lists the variable cells in the model along with their final values, contribution to the objective function, and allowable increases and decreases. It also lists the constraints in the model along with their final shadow prices and allowable increases to the right-hand sides. The original optimal solution was 61600 and it did not change after perturbing the model.

Uploaded by

Vinit
Copyright
© © All Rights Reserved
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/ 4

Microsoft Excel 16.

0 Sensitivity Report
Worksheet: [Problem.xlsx]Sheet1
Report Created: 07-02-2020 23:49:42

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$C$3 0 -0.6 3 0.6 1E+030
$D$3 16000 0 2.5 2.9 0.1
$E$3 6000 0 3.6 0.15 0.6
$F$3 0 -0.44 4.5 0.44 1E+030

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$C$7 x1 82000 0 100000 1E+030 18000
$C$8 x1 50000 1.16 50000 40000 10000
$C$9 x1 60000 0.06 60000 15000 26666.666667
S.P S.P S.P S.P
3 2.5 3.6 4.5
QTY 0 16000 6000 0 61600 Maximize
x1 x2 x3 x4

Slack
18000 82000 <= 100000 Assembly
0 50000 <= 50000 Polishing
0 60000 <= 60000 Packing

Original Solution 61600


New Solution 61600
Change in Solution 0
Assembly Polishing Packing
Variant 1 2 3 2
Variant 2 4 2 3
Variant 3 3 3 2
Variant 4 7 4 5

Variable Cells
Final Reduced Objective Allowable
Cell Name Value Cost Coefficient Increase
$C$3 0 -0.6 3 0.6
$D$3 16000 0 2.5 2.9
$E$3 6000 0 3.6 0.15
$F$3 0 -0.44 4.5 0.44

Constraints
Final Shadow Constraint Allowable
Cell Name Value Price R.H. Side Increase
$C$7 x1 82000 0 100000 1E+030
$C$8 x1 50000 1.16 50000 40000
$C$9 x1 60000 0.06 60000 15000
Allowable
Decrease Upper Limit Lower Limit
1E+030 3.6 -1E+030
0.1 5.4 2.4
0.6 3.75 3
1E+030 4.94 -1E+030

Allowable
Decrease Upper Limit Lower Limit
18000 1E+030 82000
10000 90000 40000
26666.667 75000 33333.333333

You might also like