Scribd
Upload
34 views

Excel Linear Programming

The document is a Microsoft Excel solver answer report that details the results of optimizing an objective cell to maximize a value subject to various constraints on variable cells, finding a solution in 6 iterations in under 0.05 seconds. It provides the final values of the objective and variable cells that satisfy all constraints as well as details on the solver used and constraints tested.

Uploaded by

anon_178210529
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
34 views

Excel Linear Programming

The document is a Microsoft Excel solver answer report that details the results of optimizing an objective cell to maximize a value subject to various constraints on variable cells, finding a solution in 6 iterations in under 0.05 seconds. It provides the final values of the objective and variable cells that satisfy all constraints as well as details on the solver used and constraints tested.

Uploaded by

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

Microsoft Excel 16.

0 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 7/4/2019 3:51:31 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.047 Seconds.
Iterations: 6 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)


Cell Name Original Value Final Value
$C$10 Maximize 0 63500

Variable Cells
Cell Name Original Value Final Value Integer
$C$4 x 0 100 Contin
$C$5 y 0 20 Contin
$C$6 z 0 70 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$B$14 670 $B$14<=$D$14 Not Binding 130
$B$15 1100 $B$15<=$D$15 Binding 0
$B$16 400 $B$16<=$D$16 Binding 0
$B$17 100 $B$17<=$D$17 Binding 0
$B$18 20 $B$18<=$D$18 Not Binding 80
$B$19 70 $B$19<=$D$19 Not Binding 30
$B$20 100 $B$20>=$D$20 Not Binding 100
$B$21 20 $B$21>=$D$21 Not Binding 20
$B$22 70 $B$22>=$D$22 Not Binding 70
Variables
x 100
y 20
z 70

Objective
Maximize 63500

Constraints
Inequality
1 670 <= 800
2 1100 <= 1100
3 400 <= 400
4 100 <= 100
5 20 <= 100
6 70 <= 100
7 100 >= 0
8 20 >= 0
9 70 >= 0

You might also like