Investigacion operativa i

problemas resueltos con el programa LINGO

1)

Max = 2*x1 + 3*x2;
2*x1 + x2 <= 4;
x1 + 2*x2 <= 5;

SOLUCION:

Global optimal solution found.
Objective value: 8.000000
Total solver iterations: 2

Variable Value Reduced Cost
X1 1.0000000.000000
X2 2.000000 0.000000

Row Slack or Surplus Dual Price
1 8.000000 1.000000
2 0.000000 0.3333333
3 0.000000 1.333333

2)

Max = 5*x1 + 4*x2;
6*x1 +4* x2 <= 24;
x1 + 2*x2 <= 6;
SOLUCION:
Global optimal solution found.
Objective value: 21.00000
Total solver iterations: 2

Variable Value Reduced Cost
X1 3.000000 0.000000
X2 1.5000000.000000

Row Slack or Surplus Dual Price
1 21.00000 1.000000
2 0.000000 0.7500000
3 0.000000 0.5000000

3)

Max = 8 *x1 + 5 *x2;
3 *x1 + 2 * x2 <= 9;
2 *x1 + x2 <= 5;

SOLUCION:

Global optimal solutionfound.
Objective value: 23.00000
Total solver iterations: 2

Variable Value Reduced Cost
X1 1.000000 0.000000
X2 3.000000 0.000000

Row Slack or Surplus DualPrice
1 23.00000 1.000000
2 0.000000 2.000000
3 0.000000 1.000000

4)

Max = 4 *x1 + 3 *x2;
x1 + x2 <= 40;
2 *x1 + x2 <= 60;
SOLUCION:
Global optimal solution found.
Objective value: 140.0000
Total solveriterations: 2

Variable Value Reduced Cost
X1 20.00000 0.000000
X2 20.00000 0.000000

Row Slack or Surplus Dual Price
1 140.0000 1.000000
20.000000 2.000000
3 0.000000 1.000000

5)

Max = 2 *x1 + 3 *x2;
x1 + 2 *x2 <= 6;
2 *x1 + x2 <= 8;
3 *x1 + 3 *x2 <= 9;

SOLUCION:

Global optimal solution found.
Objective value: 9.000000
Total solver iterations: 2

VariableValue Reduced Cost
X1 0.000000 0.000000
X2 3.000000 0.000000

Row Slack or Surplus Dual Price
1 9.000000 1.000000
2 0.000000 1.0000003 5.000000 0.000000
4 0.000000 0.3333333

6)

Max = 16 *x1 + 15 *x2;
40 *x1 + 30 *x2 <= 120;
x1 + x2 <= 1;

SOLUCION:

Global optimal solution found.
Objective value: 16.00000
Total solver iterations: 2

Variable...