Solución Método Simplex con MPL de Minimización

MinZ= -10x1 – 5a1 + 8b1 - 8b2 + 10 x1 a1 b1 b2 s1 s2

s.a. Base 10 5 -8 8 0 0
2x1 - a1 - b1 + b2 + S1 = 80
x1 + 2a1 + b1 – b2 +S2 = 10 s1 2 -1 -1 1 1 0
x1 + a1 + b1 – b2 +S3 = 70 s2 1 2 1 -1 0 1
x1, a1, b1, b2, S1, S2, S3 ≥0 s3 1 1 1 -1 0 0
Cambios de Variable: x2 = -a1; a1 ≥ 0 Base 0 -15 -18 18 0 -10
x3 = b1 – b2; b1, b2 ≥ 0 s1 0 -5 -3 3 1 -2
Cambio de Variable x1 1 2 1 -1 0 1
x2 = -a1; a1 ≥ 0 s3 0 -1 0 0 0 -1
x3 = b 1 – b 2 ; b1 , b 2 ≥ 0 Base 0 15 0 0 -6 2
b2 0 -1 2/3 -1 1 0.3333 -0.667
x1 1 0.33333 0 0 0.3333 0.3333
0 -1 0 0 0 -1
Base -45 0 0 0 -21 -13
b2 5 0 -1 1 2 1
a1 3 1 0 0 1 1
s3 3 0 0 0 1 0

Sol.Optima Valor Optimo

x1 = 0 -1800
a1 = 90
x2 = -a1; a1 ≥ 0 b1 = 0
x3 = b 1 – b 2 ; b1 , b 2 ≥ 0 b2 = 170
s1 = 0
s2 = 0
s3 = 150

MPL Original
Sol.Optima Valor Optimo
x1 = 0 -1800
x2 = -90
x1 = -170
s1 = 0
s2 = 0
s3 = 150
s3 sol
0 10
0 80
0 10
1 70
0 -90
0 60
0 10
1 60
0 -450
0 20
0 30
1 60
0 -1800
0 170 Tabla óptima
4ta Iteración
0 90
1 150
EL METODO DE PENALIZACION (METODO M)Min Z = (4-7M) x1 + (1-4M) x2 + ME1 + 9M
x1 x2 E1 A1 A2
BASE .7M-4 .4M-1 .-M 0 0
A1 3 1 0 1 0
A2 4 3 -1 0 1
S1 1 2 0 0 0
BASE 0 (1+5M)/3 .-M (4-7M)/3 0
X1 1 0.333333 0 0.333333 0
A1 = 3 – 3x1 - x2 A2 0 1.666667 -1 -1.33333 1
A2 = 6 - 4x1 - 3x2 + E1 S1 0 1.666667 0 -0.33333 0
A1 + A2 = -7X1 - 4X2 + E1 + 9 BASE 0 0 1/5 -1.60 .-M
MIN Z = 4X1 + X2 + M(-7X1 - 4X2 + E1 + 9) X1 2/3 0 - 1/3 0 - 1/3
Min Z = (4-7M) x1 + (1-4M) x2 + ME1 + 9M X2 0 1 -0.6 -0.8 0.6
S1 0 0 1 1 -1
BASE 0 0 0 -1 4/5 .-M
X1 2/3 0 0 1/3 - 2/3
X2 0 1 0 - 1/5 0
E1 0 0 1 1 -1
Solución Optima Valor Optimo
x1 = 1 .17/5 Mínimo
x2 = .9/5
E1 = 1
S1 = 0
A1 = 0
A2 = 0
1 + (1-4M) x2 + ME1 + 9M

S1 SOL.
0 9M
0 3
0 6
1 4
0 4 + 2M
0 1 *(4-7M)
0 2
1 3
0 3.60
- 1/3 2/3
0 1.2 *-(1+5M)/3
1 1
- 1/5 3 2/5
0 1
3/5 1 4/5
1 1
METODO DE DOBLE FASE (2 Fases)
  FASE I Min Z = A1 + A2
Max Z= 6x + 8y Min Z = –3x – 2y + E1 + 70
s.a.
x + 2y + S1 = 60 x y E1 S1 A1
x+ y - E1 + A1 = 10 BASE 3 2 -1 0 0
2x + y + A2 = 60 S1 1 2 0 1 0
x, y, S1, E1, A1, A2 ≥ 0
A1 1 1 -1 0 1
 
  A2 2 1 0 0 0
Donde: BASE 0 -1 2 0 -3
A1 = 10 – x – y + E1 S1 0 1 1 1 -1
A2 = 60 – 2x – y . X 1 1 -1 0 1
A1+A2 =70 – 3x – 2y +E1 A2 0 -1 2 0 -2
BASE 0 0 0 0 -1
La función objetivo estará dado por: S1 0 1.5 0 1 0
Min Z = –3x – 2y + E1 + 70 X 1 0.5 0 0 0
 
E1 0 -0.5 1 0 -1
 

Hallando el costor reducido de y FASE II Max Z= 6x + 8y

x y E1 S1 SOL.
BASE 0 -5 0 0 180
(0, 6, 0) 1.5 . – 8 = -5 S1 0 1.5 0 1 30
0.5 x 1 0.5 0 0 30
-0.5 E1 0 -0.5 1 0 20
BASE 0 0 0 3.333 280
y 0 1 0 0.667 20
x 1 0 0 -0.33 20
E1 0 0 1 0.333 30
Solución Optima Valor Optimo
x= 20 280 Máximo
y= 20
E1 = 30
S1 = 0
 A2 SOL.
0 70
0 60
0 10
1 60
0 40
0 50
0 10
1 40
-1 0
-0.5 30
0.5 30
0.5 20