Tableau Inicial

x1 x2 x3 x4 x5 x6
-3 2 1 1 0 0 2
-1 2 -1 0 1 0 4
1 1 4 0 0 1 5
-1 -2 -3 0 0 0 0

1. Paso
x_B = { x4 x5 x6 x_D= x1 x2 x3
1 0 0 -3 2 1
B= 0 1 0 D= -1 2 -1
0 0 1 1 1 4

1 0 0 -3 2 1
B'-1= 0 1 0 B'-1*D= -1 2 -1
0 0 1 1 1 4

0 -1
c_B= 0 c_D= -2
0 -3

2
b= 4 v= 0
5

min{ r_D -1 -2 -3 } = -3 => x3 entra a la base

min{ 2 * 1.25 } = 1.25 => x6 sale de la base

2. Paso:
x_B = { x4 x5 x3 x_D= x1 x2 x6
1 0 1 -3 2 0
B= 0 1 -1 D= -1 2 0
0 0 4 1 1 1

1 0 -0.25 -3.25 1.75 -0.25

B'-1= 0 1 0.25 B'-1*D= -0.75 2.25 0.25
0 0 0.25 0.25 0.25 0.25

0 -1
c_B= 0 c_D= -2
-3 0

0.75
B'-1b= 5.25 v= -3.75
1.25

x1 x2 x6
min r_D -0.25 -1.25 0.75 } = -1.25 => x2 entra a la base
 x4 x5 x3
min{ 0.4286 2.3333 5 }= 0.4286 => x4sale de la base

3. Paso:
x_B = { x2 x5 x3 x_D= x1 x4 x6

2 0 1 -3 1 0
B= 2 1 -1 D= -1 0 0
1 0 4 1 0 1

0.5714 0 -0.143 -1.857 0.5714 -0.143

B'-1= -1.286 1 0.5714 B'-1*D= 3.4286 -1.286 0.5714
-0.143 0 0.2857 0.7143 -0.143 0.2857

-2 -1
c_B= 0 c_D= 0
-3 0

0.4286
B'-1b= 4.2857 v= -4.286
1.1429

x1 x4 x6
min{ r_D-2.571 0.7143 0.5714 } = -2.571 => x1 entra a la base
x2 x5 x3
min{ * 1.25 1.6 }= 1.25 => x5 sale de la base

4. Paso:
x_B = { x2 x1 x3 x_D= x5 x4 x6

2 -3 1 0 1 0
B= 2 -1 -1 D= 1 0 0
1 1 4 0 0 1

-0.125 0.5417 0.1667 0.5417 -0.125 0.1667

B'-1= -0.375 0.2917 0.1667 B'-1*D= 0.2917 -0.375 0.1667
0.125 -0.208 0.1667 -0.208 0.125 0.1667

-2 0
c_B= -1 c_D= 0
-3 0

2.75
B'-1b= 1.25 v= -7.5
0.25
r_D=
min{ r_D 0.75 -0.25 1 }= -0.25 => x4 entra a la base
min{ * * 2 }= 2 => x3 sale de la base
5. Paso:
x_B = { x2 x1 x4 x_D= x5 x3 x6

2 -3 1 0 1 0
B= 2 -1 0 D= 1 -1 0
1 1 0 0 4 1

0 0.3333 0.3333 0.3333 1 0.3333

B'-1= 0 -0.333 0.6667 B'-1*D= -0.333 3 0.6667
1 -1.667 1.3333 -1.667 8 1.3333

-2 0
c_B= -1 c_D= -3
0 0

3
B'-1b= 2 v= -8
2
r_D= 0.3333 2 1.3333

El óptimo ! Todos los r_D son no negativos

s r_D son no negativos