Minimizar Z=40000X1+10000X2-0S1-0S2-0S3-0S4+MA1+MA2

s.a.
X1+S1=11
X2+S2=8 CB VB
200X1+100X2-S3+A1=1600 0 S1
6X1+15X2-S4+A2=96 0 S2
X1, X2,S2,S2,A1,A2>=0 -M A1
-M A2
ZJ-CJ =

Prueba de optimalidad Zj-Cj >=0,No,Segui

CB VB
0 S1
0 S2
-40000 X1
-M A2
ZJ-CJ =

Prueba de optimalidad Zj-Cj >=0,No,Segui

Multiplicamos por -1 para sumar a la *-1

fila 1

(+)

Multiplicamos por -1 para sumar a la *-6

(+)
CB
0
0
-40000
-10000
ZJ-CJ =
 (ITERACIÓN 0)
-40000 -10000 0 0 0 0 -M
X1 X2 S1 S2 S3 S4 A1
1 0 1 0 0 0 0
0 1 0 1 0 0 0
200 100 0 0 -1 0 1
6 15 0 0 0 -1 0
-206M+40000 -115M+10000 0 0 M M 0

timalidad Zj-Cj >=0,No,Seguir iterando

(ITERACIÓN 1)
-40000 -10000 0 0 0 0 -M
X1 X2 S1 S2 S3 S4 A1
0 -1/2 1 0 1/200 0 -1/200
0 1 0 1 0 0 0
1 1/2 0 0 -1/200 0 1/200
0 12 0 0 3/100 -1 -3/100
0 -12M-10000 0 0 -3M/100+200 M 103M/100-200

timalidad Zj-Cj >=0,No,Seguir iterando

1 1/2 0 0 -1/200 0 1/200

-1 -1/2 0 0 1/200 0 -1/200

1 0 1 0 0 0 0
-1 -1/2 0 0 1/200 0 -1/200
0 -1/2 1 0 1/200 0 -1/200

1 1/2 0 0 -1/200 0 1/200

-6 -3 0 0 3/100 0 -3/100

6 15 0 0 0 -1 0
-6 -3 0 0 3/100 0 -3/100
0 12 0 0 3/100 -1 -3/100
 (ITERACIÓN 2)
-40000 -10000 0 0 0 0
VB X1 X2 S1 S2 S3 S4
S1 0 0 1 0 1/160 -1/24
S2 0 0 0 1 -1/400 1/12
X1 1 0 0 0 -1/160 1/24
X2 0 1 0 0 1/400 -1/12
ZJ-CJ = 0 0 0 0 225 -2500/3

*-1/2 0 1 0 0 1/400 -1/12

0 -1/2 0 0 -1/800 1/24
+ 1 1/2 0 0 -1/200 0
1 0 0 0 -1/160 1/24

*-1 0 1 0 0 1/400 -1/12

0 -1 0 0 -1/400 1/12
+ 0 1 0 1 0 0
0 0 0 1 -1/400 1/12

*1/2 0 1 0 0 1/400 -1/12

0 1/2 0 0 1/800 -1/24
0 -1/2 1 0 1/200 0
0 0 1 0 1/160 -1/24
-M
A2 XB
0 11
0 8
0 1600
1 96
0 -1696M

-M
A2 XB
0 3
0 8
0 8
1 48
0 -48M-320000

0 8
0 -8

0 11
0 -8
0 3

0 8
0 -48

1 96
0 -48
1 48
 -M -M
A1 A2 XB
-1/160 1/24 5
1/400 -1/12 4
1/160 -1/24 6
-1/400 1/12 4
M-225 M+2500/3 -280000

-1/400 1/12 4
1/800 -1/24 -2
1/200 0 8
1/160 -1/24 6

-1/400 1/12 4
1/400 -1/12 -4
0 0 8
1/400 -1/12 4

-1/400 1/12 4
-1/800 1/24 2
-1/200 0 3
-1/160 1/24 5