Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
27 views

Linear Programming Using Excel

The solver found an optimal solution to maximize profit in 2 iterations. It allocated 540 units to product 1 (x1) and 252 units to product 2 (x2). The objective value increased from 47 to 7,668. All constraints were satisfied, with some having slack and others binding exactly. The sensitivity analysis showed how much each variable and constraint value could increase or decrease before affecting the optimal solution.

Uploaded by

aayush13
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views

Linear Programming Using Excel

The solver found an optimal solution to maximize profit in 2 iterations. It allocated 540 units to product 1 (x1) and 252 units to product 2 (x2). The objective value increased from 47 to 7,668. All constraints were satisfied, with some having slack and others binding exactly. The sensitivity analysis showed how much each variable and constraint value could increase or decrease before affecting the optimal solution.

Uploaded by

aayush13
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Microsoft Excel 15.

0 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 21-10-2014 10:48:27
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 2 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative
Objective Cell (Max)
Cell Name Original Value Final Value
$E$12Z 47 7668
Variable Cells
Cell Name Original Value Final Value Integer
$C$12x1 2 540 Contin
$D$12x2 3 252 Contin
Constraints
Cell Name Cell Value Formula Status Slack
$E$6 Resource 1 Total 630 $E$6<=$G$6 Binding 0
$E$7 Resource 2 Total 480 $E$7<=$G$7 Not Binding 120
$E$8 Resource 3 Total 708 $E$8<=$G$8 Binding 0
$E$9 Resource 4 Total 117 $E$9<=$G$9 Not Binding 18
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative
Microsoft Excel 15.0 Sensitivity Report
Worksheet: [Book1]Sheet1
Report Created: 21-10-2014 10:48:27
Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$C$12 x1 540 0 10 3.5 3.7
$D$12 x2 252 0 9 5.285714286 2.333333333
Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$E$6 Resource 1 Total 630 4.375 630 52.36363636 134.4
$E$7 Resource 2 Total 480 0 600 1E+30 120
$E$8 Resource 3 Total 708 6.9375 708 192 128
$E$9 Resource 4 Total 117 0 135 1E+30 18
Product 1 Product 2
Profit per Unit 10 9
Total
Resource
Availability
Resource 1 0.7 1 630 630
Resource 2 0.5 0.83 480 600
Resource 3 1 0.67 708 708
Resource 4 0.1 0.25 117 135
x1 x2 Z
540 252 7668
1 1 1 0
3 2 0 1
Cj 6 5 0 0
B B
-1
Basis x1 x2 s1 s2
1 1 -2 1 6 x1 1 0 -2 1
3 2 3 -1 5 x2 0 1 3 -1
Cj-Zj 0 0 -3 -1
Zj 6 5 3 1
5
12
RHS
2
3
27

You might also like