Professional Documents
Culture Documents
Tarea Metodo de La Gran M
Tarea Metodo de La Gran M
x1, x2
Z X1 X2 S1 R1 R2 S2
Z 1 -2 -3 0 (-)M (-)M 0
R1 0 0.5 0.25 1 0 0 0
R2 0 1 3 0 1 0 -1
S2 0 1 1 0 0 1 0
Z X1 X2 S1 R1 R2 S2
Z 1 -2 -3 0 0 0 0
M 0 0 0 0 -1 -1 0
R1 0 0.5 0.25 1 0 0 0
R2 0 1 3 0 1 0 -1
S2 0 1 1 0 0 1 0
Z X1 X2 S1 R1 R2 S2
Z 1 -2 -3 0 0 0 0
M 0 1.5 3.25 1 1 0 -1
R1 0 0.5 0.25 1 0 0 0
R2 0 1 3 0 1 0 -1
S2 0 1 1 0 0 1 0
Iteración 1
Z R1 X2 S1 R1 R2 S2
Z 1 0 -2 4 0 0 0
M 0 0 2.5 -2 1 0 -1
X1 0 1 0.5 2 0 0 0
R2 0 0 2.5 -2 1 0 -1
S2 0 0 0.5 -2 0 1 0
La solucion optima se obtiene cuando X1 = 8; X2 = 0 ; S1 = 0; S2 = 2 y z = 16
x2
x2 <= 4
x2 >= 36
x2 = 10
>= 0
b
0
4
36
10
b
0
0
4
36
10
b
0
40
4 8
36 36
10 10
b
16
28
8 8
28 #DIV/0!
2 #DIV/0!