CLASE DE GRAFOS 02/04/2012

LP OPTIMUM FOUND AT STEP 2

OBJECTIVE VALUE = 5.00000000
NEW INTEGER SOLUTION OF 5.00000000
RE-INSTALLING BEST SOLUTION...

AT BRANCH

0 PIVOT

0 PIVOT

OBJECTIVE FUNCTION VALUE

1)

5.000000

VARIABLE
VALUE
REDUCED COST
X1
1.000000
-2.000000
X2
1.000000
-3.000000
ROW
2)
3)
4)
5)

SLACK OR SURPLUS DUAL PRICES

23.000000
0.000000
23.000000
0.000000
1.000000
0.000000
1.000000
0.000000

NO. ITERATIONS=
2
BRANCHES= 0 DETERM.= 1.000E 0
LP OPTIMUM FOUND AT STEP 1
OBJECTIVE VALUE = 14.4705887
NEW INTEGER SOLUTION OF 14.0000000
BOUND ON OPTIMUM: 14.00000
ENUMERATION COMPLETE. BRANCHES=

AT BRANCH
0 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND

RE-INSTALLING BEST SOLUTION...
OBJECTIVE FUNCTION VALUE
1)

14.00000

VARIABLE
VALUE
REDUCED COST
X1
7.000000
-2.000000
X2
0.000000
-3.000000
ROW
2)
3)
4)

SLACK OR SURPLUS DUAL PRICES

0.000000
0.000000
8.000000
0.000000
7.000000
0.000000

5)

0.000000

0.000000

NO. ITERATIONS=
3
BRANCHES= 0 DETERM.= 1.000E 0
MAX 2 X1 + 3 X2
SUBJECT TO
2) 5 X1 + 7 X2 <= 35
3) 4 X1 + 9 X2 <= 36
4) X1 >= 0
5) X2 >= 0
END
GIN 2
LP OPTIMUM FOUND AT STEP 5
OBJECTIVE VALUE = 14.4705887
NEW INTEGER SOLUTION OF 14.0000000
BOUND ON OPTIMUM: 14.00000
ENUMERATION COMPLETE. BRANCHES=

AT BRANCH
0 PIVOTS=

LAST INTEGER SOLUTION IS THE BEST FOUND

RE-INSTALLING BEST SOLUTION...
OBJECTIVE FUNCTION VALUE
1)

14.00000

VARIABLE
VALUE
REDUCED COST
X1
4.000000
-2.000000
X2
2.000000
-3.000000
ROW
2)
3)
4)
5)

SLACK OR SURPLUS DUAL PRICES

1.000000
0.000000
2.000000
0.000000
4.000000
0.000000
2.000000
0.000000

NO. ITERATIONS=
8
BRANCHES= 0 DETERM.= 1.000E 0

CLASE DE GRAFOS 9/04/2012

max 1500x1+3000x2+1800x3+2000x4+2500x5+3500x6+2200x7
SUBJECT TO
3.5x1+6.3x2+5x3+1.5x4+6.4x5+7.8x6+4.5x7<=20
end
integer x1
integer x2
integer x3

0 PIVOT
8

integer x4
integer x5
integer x6
integer x7
En el programa de LINDO nos da el siguiente resultado:
LP OPTIMUM FOUND AT STEP 4... (Solucin del problema relajado)
OBJECTIVE VALUE = 10655.1279. (Solucin del problema relajado)

NEW INTEGER SOLUTION OF 10000.0000

RE-INSTALLING BEST SOLUTION...

AT BRANCH

0 PIVOT

OBJECTIVE FUNCTION VALUE

1)

10000.00

VARIABLE
VALUE
REDUCED COST
X1
1.000000 -1500.000000
X2
1.000000 -3000.000000
X3
0.000000 -1800.000000
X4
1.000000 -2000.000000
X5
0.000000 -2500.000000
X6
1.000000 -3500.000000
X7
0.000000 -2200.000000
ROW SLACK OR SURPLUS DUAL PRICES
2)
0.900000
0.000000
NO. ITERATIONS=
4
BRANCHES= 0 DETERM.= 1.000E 0
//////////////////////////////////////////////////////////////////////////////////////////////////////
CLASE 07/02012
min 5x1+7x2+10x3+3x4+x5
st
-x1+3x2-5x3-x4+4x5<=-2
2x1-6x2+3x3+2x4-2x5<=0
x2-2x3+x4+x5<=-1
end
integer x1
integer x2
integer x3
integer x4
integer x5
EN EL LINDO
LP OPTIMUM FOUND AT STEP

OBJECTIVE VALUE = 9.00000000

NEW INTEGER SOLUTION OF 17.0000000
RE-INSTALLING BEST SOLUTION...

AT BRANCH

OBJECTIVE FUNCTION VALUE

1)

17.00000

VARIABLE
VALUE
X1
0.000000
X2
1.000000
X3
1.000000
X4
0.000000
X5
0.000000
ROW
2)
3)
4)

REDUCED COST
5.000000
7.000000
10.000000
3.000000
1.000000

SLACK OR SURPLUS DUAL PRICES

0.000000
0.000000
3.000000
0.000000
0.000000
0.000000

NO. ITERATIONS=
1
BRANCHES= 0 DETERM.= 1.000E 0

0 PIVOT