Optimizacin y Simulacin
Ing. Lourdes Roxana Daz Amaya
LOGRO DE SESIN
[Si ]
[No] Es
Maxi mi zaci on
[Si ]
mi ni mi zaci on:
Cj -Zj >=0 Cj -Zj <=0
[Si ] [Si ]
Fi nal
[No]
2x1 + x2 <= 6
5x1 + 4x2 >=20
X1, x2 >=0
2x1 + x2 <= 6
5x1 + 4x2 >=20
x1 >=0
x2 >=0
Min z = 2x1+10x2
2x1 + x2 + x3 = 6
5x1 + 4x2 x4 + x5 =20
x1 >=0
x2 >=0
SOLUCIN: MTODO SIMPLEX
PASO 2
Minimizar Z= 2X1 + 10
X2+0x3+0x4+Mx5
SOLUCIN: MTODO SIMPLEX
PASO 3
Tabla Simplex
variables de holgura (x3)
Variables de exceso (x4)
variables asignadas Variable auxiliar (x5)
o bsicas
PL : Minimizacion
Matriz identidad
2 10 0 0 M
X1 X2 X3 X4 X5
0 X3 2 1 1 0 0 6
M X5 5 4 0 -1 1 20
Zj x
Costos
Cj-Zj Contribucin
Neta a bajar los
costos
PL : Minimizacion
2 10 0 0 M
X1 X2 X3 X4 X5
0 X3 2 1 1 0 0 6
M X5 5 4 0 -1 1 20
Zj 5M 4M 0 -M M 20M
Cj-Zj 2-5M 10-4M 0 M 0
PL : Minimizacin
2 10 0 0 M
X1 X2 X3 X4 X5
6/2 = 3 unidades.
0 X3 2 1 1 0 0 6 20 /5 =4 unidades.
M X5 5 4 0 -1 1 20
Zj 5M 4M Razn menor x3 ( variable de
0 -M M 20M
salida )
Cj-Zj 2-5M 10-4M 0 M 0
Mayor
Contribucin x1
( variable de
entrada )
SOLUCIN: MTODO SIMPLEX
PASO 6
PL : Minimizacin
2 10 0 0 M
Dividimos a la fila
x1 x2 x3 x4 x5 pivot entre 2
0 x3 2 1 1 0 0 6
M x5 5 4 0 -1 1 20
Zj 5M 4M 0 -M M 20M
Cj-Zj 2-5M 10-4M 0 M 0
PL : Minimizacin
2 10 0 0 M
x1 x2 x3 x4 x5
2 x1 1 1/2 0 0 3
M x5 5 4 0 -1 1 20
Zj
Cj-Zj
SOLUCIN: MTODO SIMPLEX
PASO 6
PL : Minimizacin
Multiplicamos a la fila 1 por -5 y
2 10 0 0 M sumamos a la fila 2
x1 x2 x3 x4 x5
2 x1 1 1/2 0 0 3
M x5 5 4 0 -1 1 20
Zj
Cj-Zj
-5 1 1/2 0 0 3
5 4 0 -1 1 20
0 -5/2+4 -5/2 -1 1 -15+20
PL : Minimizacin
2 10 0 0 M
x1 x2 x3 x4 x5
2 x1 1 1/2 0 0 3
M x5 0 +3/2 -5/2 -1 +1 +5
Zj
Cj-Zj
SOLUCIN: MTODO SIMPLEX
PASO 7
PL : Minimizacin
2 10 0 0 M
x1 x2 x3 x4 x5
2 x1 1 1/2 0 0 3
M x5 0 +3/2 -5/2 -1 +1 +5
Zj 2 1+3M/2 1-5M/2 -M M 6+5M
10-1-
Cj-Zj 0 3M/2 -1+5M/2 M 0
PL : Minimizacin
2 10 0 0 M
x1 x2 x3 x4 x5
2 x1 1 1/2 0 0 3
M x5 0 +3/2 -5/2 -1 +1 +5
Zj 2 1+3M/2 1-5M/2 -M M 6+5M
Cj-Zj 0 9-3M/2 -1+5M/2 M 0
2 10 0 0 M
3/(1/2) = 6 unidades.
x1 x2 x3 x4 x5 5/(3/2) =10/3 unidades.
2 x1 1 1/2 0 0 3
M x5 0 +3/2 -5/2 -1 +1 +5
Zj 2 1+3M/2 1-5M/2 -M M 6+5M
Cj-Zj 0 9-3M/2 -1+5M/2 M 0
Mayor Contribucin
a disminuir los
costos x2 ( variable
de entrada )
SOLUCIN: MTODO SIMPLEX
PASO 4
PL : Minimizacin
2 10 0 0 M
x1 X2 x3 x4 x5
2 x1 1 1/2 0 0 3
10 x2 0 +3/2 -5/2 -1 +1 +5
Zj
Cj-Zj
PL : Minimizacin
2 10 0 0 M
x1 x2 x3 x4 x5
Dividimos a la fila
2 X1 1 1/2 0 0 3 pivot entre 3/2
10 X2 0 +3/2 -5/2 -1 +1 +5
Zj
Cj-Zj
SOLUCIN: MTODO SIMPLEX
PASO 6
PL : Minimizacin
2 10 0 0 M
X1 x2 x3 x4 x5
2 x1 1 1/2 0 0 3
10 X2 0 +1 -5/3 -2/3 +2/3 10/3
Multiplicamos a fila
Zj
2 por -1/2 y
Cj-Zj
sumamos la fila 1
1 1/2 0 0 3
-1/2 0 +1 -5/3 -2/3 +2/3 10/3
1 0 8/6 2/6 -2/6 4/3
PL : Minimizacin
2 10 0 0 M
x1 x2 x3 x4 x5
2 x1 1 0 8/6 2/6 -2/6 4/3
10 x2 0 +1 -5/3 -2/3 +2/3 10/3
Zj
Cj-Zj
SOLUCIN: MTODO SIMPLEX
PASO 7 , Y 8
PL : Minimizacin
2 10 0 0 M
x1 x2 x3 x4 x5
2 x1 1 0 4/3 1/3 -1/3 4/3
10 x2 0 +1 -5/3 -2/3 +2/3 10/3
Zj 2 10 -14 -6 6 36
Cj-Zj 0 0 14 6 M-6