0% found this document useful (0 votes)
31 views3 pages

Cell Name Original Value Final Value

The document summarizes the results of using the Solver tool in Microsoft Excel to solve an optimization problem with constraints. The solver found a solution using the Simplex LP algorithm in 0.016 seconds over 2 iterations. The objective cell was maximized to a value of 813.333333333. The optimal values for the two variable cells were 2666.66666667 for x1 and 2000 for x2. All constraints were satisfied, with the mano de obra constraint binding at its limit of 12000 and slack values of 0 for the other constraints.

Uploaded by

George Castillo
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
0% found this document useful (0 votes)
31 views3 pages

Cell Name Original Value Final Value

The document summarizes the results of using the Solver tool in Microsoft Excel to solve an optimization problem with constraints. The solver found a solution using the Simplex LP algorithm in 0.016 seconds over 2 iterations. The objective cell was maximized to a value of 813.333333333. The optimal values for the two variable cells were 2666.66666667 for x1 and 2000 for x2. All constraints were satisfied, with the mano de obra constraint binding at its limit of 12000 and slack values of 0 for the other constraints.

Uploaded by

George Castillo
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/ 3

Microsoft Excel 14.

0 Answer Report
Worksheet: [3.1-10 solver.xlsx]Hoja1
Report Created: 04/23/2020 12:50:08 p.m.
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, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)


Cell Name Original Value Final Value
$B$3 F.O. Max. Z= 0 813.333333333

Variable Cells
Cell Name Original Value Final Value Integer
$D$7 x1 0 2666.66666667 Contin
$E$7 x2 0 2000 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$F$10 mano de obra Rec. Utiliz. 12000.00 $F$10<=$H$10 Binding 0
$F$8 harina Rec. Utiliz. 666.67 $F$8<=$H$8 Not Binding 133.33333333
$F$9 puerco Rec. Utiliz. 200.00 $F$9<=$H$9 Binding 0
Solucion con Solver
F.O. Max. Z= B/. 3.33
Z
X1 X2
3 2 x1 x2
0.667 0.667 Rec. Utiliz. Rec. Disp.
Q 2 1 2.000 <= 2
R 1 2 2.000 <= 2
S 3 3 4.000 <= 4
X1, X2 >=0

Restricciones
Z=3x1+2x2
2x1+x2<=2
x1+2x2<=2
3x1+3x2<=4

You might also like