Anda di halaman 1dari 7

Lingo

MAX 3000X1+5000X2
ST
X1<=4
2X2<=12
3X1+2X2<=18
END

Global optimal solution found.


Objective value: 36000.00
Infeasibilities: 0.000000
Total solver iterations: 1
Elapsed runtime seconds: 118.86

Model Class: LP

Total variables: 2
Nonlinear variables: 0
Integer variables: 0

Total constraints: 4
Nonlinear constraints: 0

Total nonzeros: 6
Nonlinear nonzeros: 0

Variable Value Reduced


Cost
X1 2.000000
0.000000
X2 6.000000
0.000000

Row Slack or Surplus Dual


Price
1 36000.00
1.000000
2 2.000000
0.000000
3 0.000000
1500.000
4 0.000000
1000.000
Lindo

MAX 3000X1+5000X2

ST

X1<=4

2X2<=12

3X1+2X2<=20

END

GIN X1
INVOPE 2
GIN X2
LP OPTIMUM FOUND AT STEP 2

OBJECTIVE FUNCTION VALUE

1) 36000.00

VARIABLE VALUE REDUCED COST

X1 2.000000 0.000000

X2 6.000000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 2.000000 0.000000

3) 0.000000 1500.000000

4) 0.000000 1000.000000

NO. ITERATIONS= 2

RANGES IN WHICH THE BASIS IS UNCHANGED:

OBJ COEFFICIENT RANGES

VARIABLE CURRENT ALLOWABLE ALLOWABLE

COEF INCREASE DECREASE

X1 3000.000000 4500.000000 3000.000000

X2 5000.000000 INFINITY 3000.000000

RIGHTHAND SIDE RANGES


ROW CURRENT ALLOWABLE ALLOWABLE

RHS INCREASE DECREASE

2 4.000000 INFINITY 2.000000

3 12.000000 6.000000 6.000000

4 18.000000 6.000000 6.000000

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE FUNCTION VALUE

1) 38000.00

VARIABLE VALUE REDUCED COST

X1 2.666667 0.000000

X2 6.000000 0.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 1.333333 0.000000

3) 0.000000 1500.000000

4) 0.000000 1000.000000

NO. ITERATIONS= 0

RANGES IN WHICH THE BASIS IS UNCHANGED:

OBJ COEFFICIENT RANGES


VARIABLE CURRENT ALLOWABLE ALLOWABLE

COEF INCREASE DECREASE

X1 3000.000000 4500.000000 3000.000000

X2 5000.000000 INFINITY 3000.000000

RIGHTHAND SIDE RANGES

ROW CURRENT ALLOWABLE ALLOWABLE

RHS INCREASE DECREASE

2 4.000000 INFINITY 1.333333

3 12.000000 8.000000 4.000000

4 20.000000 4.000000 8.000000

LP OPTIMUM FOUND AT STEP 0

OBJECTIVE VALUE = 38000.0000

NEW INTEGER SOLUTION OF 36000.0000 AT BRANCH 0 PIVOT 1

BOUND ON OPTIMUM: 36000.00

ENUMERATION COMPLETE. BRANCHES= 0 PIVOTS= 1

LAST INTEGER SOLUTION IS THE BEST FOUND

RE-INSTALLING BEST SOLUTION...

OBJECTIVE FUNCTION VALUE

1) 36000.00

VARIABLE VALUE REDUCED COST


X1 2.000000 -3000.000000

X2 6.000000 -5000.000000

ROW SLACK OR SURPLUS DUAL PRICES

2) 2.000000 0.000000

3) 0.000000 0.000000

4) 2.000000 0.000000

NO. ITERATIONS= 1

BRANCHES= 0 DETERM.= 1.000E 0

MAX 3000X1+5000X2 X1 X2
ST MATRIZ DE COEFICIENTES SIGNO RESTRICCIONES REALES
X1<=4 P1 T 1 0 <= 4
2X2<=12 P2 E 0 2 <= 12
3X1+2X2<=18 P3M 3 2 <= 18
END

X1 X2 RESTRICCIONES CALCULADAS
REST 1 2 6 <= 2
REST 2 2 6 <= 12
REST 3 2 6 <= 18
X1 X2
VALORES 2 6 36000 FO

Anda mungkin juga menyukai