Documentos de Académico
Documentos de Profesional
Documentos de Cultura
tabla del simplex correspondiente a una solucin factible bsica puede generarse
directamente de las ecuaciones originales por medio de operaciones matriciales.
Max (o Min) Z = Cx
Ax = b
x0
x1
...
C = (C1, C2, ..., Cn)
1xn x=
xm
nx1
xn
a11
a21
A = .........
a12
a22
...
...
a1n
a2n
...
b1
b2
m x n b = ...
am1
am2
...
amn
m<n
A = [ P1
P2
mx1
bm
a1i
a2i
Pi =
ami
Pn ]
mx1
i = 1, ..., n
Supongamos que tenemos una solucin factible con variables bsicas x1 ... xm
La matriz bsica B ser:
B = (P1 ...
a11
a21
Pm) = ...
am1
a12
a22
...
am2
...
...
...
...
a1m
a2m
...
amm
matrix m x m
xB
x=
xN
x1
x2
xm
xm+1
xn
xB variables bsicas
xN variables no bsicas = 0
17
InvestigacinOperativa 2008/09
_
b1
__
_
b2
-1
b
=
La solucin bsica actuales xB= b =B
__
bm
yxN =
...
( 0 ).
_
b
xB
Z = Cx= (CBCN)
= (CB, CN)
xN
_
= CBxB + CNxN = CBb
y cualquiercolumna:
_
_
-1
18
InvestigacinOperativa 2008/09
Ejemplo:
Min Z = -3x1 + x2 + x3
sujeto a
x1 2x2 + x3 11
-4x1 + x2 + 2x3 3
2x1
- x3 = -1
xi 0
Min Z = -3x1 + x2 + x3 + Mx6 + Mx7
= 11
x1 - 2x2 + x3 + x4
=3
-4x1 + x2 + 2x3
x5 + x6
-2x1
+ x3
+ x7 = 1
xi 0
A=
[ P1
P2
P1 =
1
-4
-2
P2 =
-2
1
0
P7 =
0
0
1
P6 ]
1
P3 = 2
1
1
P4 = 0
0
b=
1
0
0
_
-1
0
P6 = 1
0
0
1
0
0
0
1
11
3
1
B =I
0
P5 = -1
-1
b=B b=b
La tabla 1 del mtodo del simplex revisado ser:
Base
x4
x6
x7
-1
B-1
1
0
0
0
1
0
0
0
1
_
b
11
3
1
A completar
msadelante
-1
19
_
1
C1 = -3 (0, M, M) -4
-2
= -3 + 6M
_
C2 = 1 (0, M, M)
-2
1
0
=1M
_
C3 = 1 (0, M, M)
1
2
1
= 1 3M
_
C5 = 0 (0, M, M)
0
-1
0
=M
1
1
=B P= 0
0
1
0
0
1
2
1
2
Tabla 1.
Base
1
0
0
x4
x6
x7
B-1
0
1
0
Var. queentra
0
0
1
Columnapivote P3
11
3
1
1
2
1
x3
11
-1
B =
_
11
-1
-1
b=B b=B 3
1
1
0
0
0
1
0
10
1
1
P3] =
-1
-2
1
20
1
0
0
0
1
0
1
2
1
InvestigacinOperativa 2008/09
Base
B-1
1
0
0
x4
x6
x3
-1
0
1
0
-1
-2
1
-1
10
1
1
-1
-2
_
-1
-1
entra x2 en la base P2 = B P2 = B
1
0
-2
= 1
0
Tabla 2.
Base
B-1
1
0
0
x4
x6
x3
0
1
0
0
0
1
varqueentra
P2
10
1
1
-2
1
0
10
x2
_
-1
b=B b=
12
1
1
Base
x4
x2
x3
1
= (0, 0, 1) 0
0
B-1
1
0
0
2
1
0
2
1
0
-5
-2
1
-5
-2
1
12
1
1
= (0, 1, -1)
21
2
1
0
-5
-2
1
InvestigacinOperativa 2008/09
_
C1 = -1 entra x1
_
P1 =
1
0
0
2
1
0
-5
-2
1
1
-4
-2
_
C5 = 1
Tabla 3.
Base
B-1
1
0
0
x4
x2
x3
2
1
0
Varqueentra
-5
-2
1
12
1
1
_
P1
x1
3
0
-2
Tabla 4.
Base
1
x1
/3
0
2
/3
x2
x3
1
= (-3, 1, 1) 0
2
_
1
C4 = /3
_
B-1
/3
/3
/3
1
4
/3
2
/3
1
4
/3
- /3
-2
7
- /3
4
1
9
- /3
1 1 2
= [- /3, /3, /3]
-2
7
- /3
C5 = /3
Por lo tanto, la tabla 4 es ptima y la solucin ptima es:
x1 = 4
x2 = 1
x3 = 9
x4 = x5 = 0
_
4
Z = CBb = (-3, 1, 1) 1 = -2
9
3
0
-2
EJERCICIOS PROPUESTOS
1.- F.O. MAX Z = 2 X1 + X2 + 3 X3
s.a
2. - Max z = 2x2 + x3
s.a.
x1 2x2 + x3 4 x1 + x2
+ x3 9 2x1 x2 x3 5
x1, x2, x3 0