Scribd
Upload
40 views5 pages

No Equilibrado

The document describes the results of solving several linear programming problems. The first problem has no feasible solution due to infeasibilities of 2500 units. The second problem finds a global optimal solution with an objective value of 175. The third problem also has no feasible solution, with infeasibilities of 200,000 units. The final problem finds a global optimal solution with an objective value of -435,000. It provides the optimal values of the variables and dual prices of the constraints for each solved problem.

Uploaded by

Coco M. Cbz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
40 views5 pages

No Equilibrado

The document describes the results of solving several linear programming problems. The first problem has no feasible solution due to infeasibilities of 2500 units. The second problem finds a global optimal solution with an objective value of 175. The third problem also has no feasible solution, with infeasibilities of 200,000 units. The final problem finds a global optimal solution with an objective value of -435,000. It provides the optimal values of the variables and dual prices of the constraints for each solved problem.

Uploaded by

Coco M. Cbz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

NO EQUILIBRADO:

min 0.07x1+0.05x2+0.1x3+0.03x4+0.11x5+0.04x6
st
x1+x2+x3=5000
x4+x5+x6=5000
x1+x4=4000
x2+x5=2000
x3+x6=1500
end

No feasible solution found.


Infeasibilities: 2500.000
Total solver iterations: 2
Elapsed runtime seconds: 8.37

Model Class: LP

Total variables: 6
Nonlinear variables: 0
Integer variables: 0

Total constraints: 6
Nonlinear constraints: 0

Total nonzeros: 18
Nonlinear nonzeros: 0

Variable Value
Reduced Cost
X1 0.000000
0.1000000
X2 1000.000
0.000000
X3 4000.000
0.000000
X4 4000.000
0.000000
X5 1000.000
0.000000
X6 0.000000 -
0.1200000

Row Slack or Surplus Dual


Price
1 2500.000 -
1.000000
2 0.000000 -
110000.1
3 0.000000 -
110000.2
4 0.000000
110000.1
5 0.000000
110000.1
6 -2500.000
110000.0

EQUILIBRADO:
min 0.07x1+0.05x2+0.1x3+0.03x4+0.11x5+0.04x6-0.05x7-0.08x8
st
x7+x1+x2+x3=5000
x8+x4+x5+x6=5000
x1+x4=4000
x2+x5=2000
x3+x6=1500
end

Global optimal solution found.


Objective value: 175.0000
Infeasibilities: 0.000000
Total solver iterations: 1
Elapsed runtime seconds: 0.11

Model Class: LP

Total variables: 8
Nonlinear variables: 0
Integer variables: 0

Total constraints: 6
Nonlinear constraints: 0

Total nonzeros: 22
Nonlinear nonzeros: 0

Variable Value
Reduced Cost
X1 500.0000
0.000000
X2 2000.000
0.000000
X3 0.000000
0.2000000E-01
X4 3500.000
0.000000
X5 0.000000
0.1000000
X6 1500.000
0.000000
X7 2500.000
0.000000
X8 0.000000
0.1000000E-01
Row Slack or Surplus Dual
Price
1 175.0000 -
1.000000
2 0.000000
0.5000000E-01
3 0.000000
0.9000000E-01
4 0.000000 -
0.1200000
5 0.000000 -
0.1000000
6 0.000000 -
0.1300000

NO EQUILIBRADO:
min 0.1x1+0.05x2+0.07x3+0.09x4+0.05x5+0.11x6+0.08x7+0.07x8
st
x1+x2+x3+x4=300000
x5+x6+x7+x8=500000
x1+x5=200000
x2+x6=100000
x3+x7=400000
x4+x8=300000
end

No feasible solution found.


Infeasibilities: 200000.0
Total solver iterations: 3
Elapsed runtime seconds: 4.04

Model Class: LP

Total variables: 8
Nonlinear variables: 0
Integer variables: 0

Total constraints: 7
Nonlinear constraints: 0

Total nonzeros: 24
Nonlinear nonzeros: 0

Variable Value
Reduced Cost
X1 0.000000
0.6000000E-01
X2 100000.0
0.000000
X3 100000.0
0.000000
X4 100000.0
0.000000
X5 200000.0
0.000000
X6 0.000000
0.5000000E-01
X7 300000.0
0.000000
X8 0.000000 -
0.3000000E-01

Row Slack or Surplus Dual


Price
1 200000.0 -
1.000000
2 0.000000
109999.9
3 0.000000
109999.9
4 0.000000 -
110000.0
5 0.000000 -
110000.0
6 0.000000 -
110000.0
7 -200000.0 -
110000.0

EQUILIBRADO:
min 0.1x1+0.05x2+0.07x3+0.09x4+0.05x5+0.11x6+0.08x7+0.07x8-21x9-19x10-
22x11-20x12
st
x1+x2+x3+x4=300000
x5+x6+x7+x8=500000
x9+x1+x5=200000
x10+x2+x6=100000
x11+x3+x7=400000
x12+x4+x8=300000
end

Global optimal solution found.


Objective value: -4350000.
Infeasibilities: 0.000000
Total solver iterations: 6
Elapsed runtime seconds: 0.11

Model Class: LP

Total variables: 12
Nonlinear variables: 0
Integer variables: 0

Total constraints: 7
Nonlinear constraints: 0

Total nonzeros: 32
Nonlinear nonzeros: 0
Variable Value
Reduced Cost
X1 0.000000
0.3000000E-01
X2 100000.0
0.000000
X3 200000.0
0.000000
X4 0.000000
0.000000
X5 200000.0
0.000000
X6 0.000000
0.8000000E-01
X7 0.000000
0.3000000E-01
X8 300000.0
0.000000
X9 0.000000
1.000000
X10 0.000000
3.020000
X11 200000.0
0.000000
X12 0.000000
1.980000

Row Slack or Surplus Dual


Price
1 -4350000. -
1.000000
2 0.000000 -
22.07000
3 0.000000 -
22.05000
4 0.000000
22.00000
5 0.000000
22.02000
6 0.000000
22.00000
7 0.000000
21.98000

You might also like