Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Max Z = CX
(P) s.a. AX b
X0
En este 2° algoritmo no es necesario tener una solución básica dual-factible y por lo tanto no se introduce la
restricción Xj M
jJ
Paso 5) Tomamos como elemento pivote a Ylk, aplicamos Gauss Jordan y regresamos al Paso 1).
Ejemplo 5
Maximizar Z = X1 - 3X2
s.a. X1 - X2 2
(P) X1 + X2 4
2X1 - 2X2 3
X1, X2 0
Maximizar Z = X1 - 3X2
s.a. X1 - X2 + X3 = 2
(P) -X1 - X2 + X4 = -4
-2X1 + 2X2 +X5 = -3
X1, X2, X3, X4, X5 0
X1 X2 X3 X4 X5
X3 1 -1 1 0 0 2
X4 -1* -1 0 1 0 -4
X5 -2 2 0 0 1 -3
-Z 1 -3 0 0 0 0
X3 0 -2* 1 1 0 -2
X1 1* 1 0 -1 0 4
X5 0 4 0 -2 1 5
-Z 0 -4 0 1 0 -4
X2 0 1* -1/2 -1/2 0 1
X1 1 0 1/2 -1/2 0 3
X5 0 0 2 0 1 1
-Z 0 0 -2 -1 0 0
Max Z = 2X3
-X1 + X2 + X3 4
2X1 - X2 + 4X3 10
X1, X2, X3 0
Max Z = 2X3
-X1 + X2 + X3 +X5 = 4
X1 + X2 + X3 +X0 = M
X1 X2 X3 X4 X5 X6 X0 XB
X4 1 -2 2 1 0 0 0 -8
X5 -1 1 1 0 1 0 0 4
X6 2 -1 4 0 0 1 0 10
X0 1 1 1 0 0 0 1 M
-Z 0 0 2 0 0 0 0 0
X1 X2 X3 X4 X5 X6 X0 XB
X4 -1 -4 0 1 0 0 -2 -8 -2M
X5 -2 0 0 0 1 0 -1 4–M
X6 -2 -5 0 0 0 1 -4 10 –4M
X3 1 1 1* 0 0 0 1 M
-Z -2 -2 0 0 0 0 -2 -2M
X1 X2 X3 X4 X5 X6 X0
X4 3/5 0 0 1 0 -4/5 6/5 -16 +6/5M
X5 -2 0 0 0 1 0 -1 4–M
X2 2/5 1 0 0 0 -1/5 4/5 -2 + 4/5M
X3 3/5 0 1 0 0 1/5 1/5 2 + 1 / 5M
-Z -6/5 0 0 0 0 -2/5 -2/5 -4 –2 / 5M
X1 X2 X3 X4 X5 X6 X0
X4 -9/5 0 0 1 6/5 -4/5 0 -56/5
X0 2 0 0 0 -1 0 1 -4 + M
X2 -6/5 1 0 0 4/5 -1/5 0 6/5
X3 1/5 0 1 0 1/5 1/5 0 14/5
-Z -2/5 0 0 0 -2/5 -2/5 0 -28/5
X1 X2 X3 X4 X5 X6 X0
X1 1 0 0 -5/9 -2/3 4/9 0 56/9
X0 0 0 0 10/9 1/3 -8/9 1 76/9 + M
X2 0 1 0 -2/3 0 1/3 0 26/3
X3 0 0 1 1/9 1/3 1/9 0 14/9
-Z 0 0 0 -2/9 -2/3 -2/9 0 -28/9
Max Z = 2X3
-X1 + X2 + X3 + X5 = 4
2X1 - X2 + 4X3 + X6 = 10
X1 X2 X3 X4 X5 X6 XB
X4 1 -2* 2 1 0 0 -8 Más negativo
X5 -1 1 1 0 1 0 4
X6 2 -1 4 0 0 1 10
-Z 0 0 2 0 0 0 0
X1 X2 X3 X4 X5 X6 XB
X2 -3/4 1 0 -1/4 1/2 0 4
X3 -1/4 0 1 1/4 ½ 0 0
X6 3 /4 0 0 -5/4 -3/2 1 14
-Z ½ 0 0 -1/2 -1 0 0
X1 X2 X3 X4 X5 X6 XB
X2 0 1 0 -2/3 0 1/3 26/3
X3 0 0 1 1/9 1/3 1/9 14/9
X1 1 0 0 -5/9 -2/3 4/9 56/9
-Z 0 0 0 -2/9 -2/3 -2/9 -28/9
La solución óptima:
X1 = 6.22 X2 = 8.66 X3 = 1.55 Zmax = 3.111
EJERCICIOS
1. Considere el siguiente problema
Maximizar Z = -X1 - X2
s.a. X1 + X2 8
(P) X2 3
-X1 + X2 2
X1, X2 0
s.a. 2X1 + X2 2
(P) X1 - X2 2
X1 , X2 0
ii)
Min Z = 3X1 + 2 X2
s.a. 2X1 + X2 10
-3X1 + 2X2 6
(P) X1 + X2 6
X1 , X2 0
iii)
(P)
Max Z = -X1 + 4 X2
s.a. -3X1 + X2 6
X1 + 2X2 4
(P)
X2 -3
X1 , X2 0
iv)
Max Z = 3X1 + 2 X2 + 7 X3
s.a. -X1 + X2 = 10
(P)
2X1 - X2 + X3 10