Professional Documents
Culture Documents
Rengln de Z j C j
Variables Bsicas
Actuales
Variables no bsicas
iniciales
Variables bsicas
iniciales
Solucin
C BT B 1a j C j
C BT B 1
Z = C BT B 1b
B 1a j
Matriz inversa
X B = B 1b
B 1
Donde:
C BT = Transpuesta de los coeficientes en la funcin objetivo de las variables bsicas.
B 1 = Matriz inversa formada por los vectores de las variables bsicas iniciales.
a j = Coeficientes en las restricciones de la variable j, tambin llamados coeficientes
tecnolgicos.
C j = Coeficientes en la funcin objetivo de las variable j a analizar.
X B = Variable bsica
b = Elementos del lado derecho de las restricciones o bien trminos
independientes.
Max. Z =
S.a:
2X1 +
X2
X3
+ 5X4
Variable
Bsica
S1
X4
X2
S3
1/2
-1/2
1/14
1/7
Solucin
26
68
34/7
12/7
B-1
8
1/ 2
1
= 0 6 / 7 1 / 14
0 2 / 7 1/ 7
8
1 / 2 46 68
1
X B = B b = 0 6 / 7 1 / 14 4 = 34 / 7
0 2 / 7 1 / 7 20 12 / 7
8
1/ 2
1
C BT B 1 = (0 5 1) 0 6 / 7 1 / 14 = (0 4 1 / 2 )
0 2 / 7 1/ 7
68
Z = C BT B 1b = C BT X B = (0 5 1) 34 / 7 = 26
12 / 7
= C BT B 1b
46
= (0 4 1 / 2 ) 4 = 26
20
8
7
3 7 11 0
8
0
1 / 2 1
1
0 6 / 7 1 / 14 3 / 2 1 / 2 1 / 2 1 = 11 / 7 0 2 / 7 1
B aj
j =1, 2,3, 4
0 2 / 7 1 / 7 4
6
2 2 1 / 7 1 3 / 7 0
C BT B 1a j
Cj
j =1, 2,3, 4
8
0
11 0
= (0 5 1)11 / 7 0 2 / 7 1 (2 1 1 5)
1/ 7 1 3 / 7 0
= (8 1 1 5) (2 1 1 5) = (6 0 2 0 )
1k
rk
2k
rk
= .
1
rk
.
mk
rk
fila r
Ejercicio 2.11
Sea el problema siguiente, resolver por el mtodo simplex revisado.
Max Z =
S.a:
X1, X2, X3 0
2X1 -
X2
3X1 +
X1 X1 +
X2 + X3 60
X2 + 2X3 10
X2 - X3 20
+ X3
2X1 - X2 + X3
3X1 + X2 + X3 + S1
= 60
X1 - X2 + 2X3
+ S2
= 10
X1 + X2 - X3
+ S3 = 20
X1, X2, X3, S1, S2, S3 0
Solucin inicial:
S1 1 0 0 60 60
X B = B b = S 2 0 1 0 10 = 10
S 0 0 1 20 20
3
1 0 0
= 0 1 0
0 0 1
1 0 0
= (0 0 0 ) 0 1 0 = (0 0 0 )
0 0 1
1
3 1
T 1
C B B a j C j j = X 1, X 2, X 3 = (0 0 0 ) 1 1 2 (2 1 1) = ( 2 1 1)
1 1 1
C BT B 1
1 3 0
E = 0 1 0
0 1 1
B 1 siguiente = EB 1 actual
1 3 0 1 0 0 1 3 0
= 0 1 0 0 1 0 = 0 1 0
0 1 1 0 0 1 0 1 1
Nueva solucin:
S1 1 3 0 60 30
X B = B b = X 1 0 1 0 10 = 10
S 0 1 1 20 10
3
1
1 3 0
= (0 2 0 ) 0 1 0 = (0 2 0 )
0 1 1
60
T 1
Z = C B B b = (0 2 0 ) 10 = 20
20
C BT B 1
Prueba de optimalidad:
(C
T 1
BB aj
Cj
j = X 2, X 3, S 2
1 0
1
= (0 2 0 ) 1 2 1 ( 1 1 0 ) = ( 1 3 2 )
1 1 0
B a 2 = 0 1 0 1 = 1
0 1 1 1 2
= 1 / 2
1 / 2
1 0 2
E = 0 1 1/ 2
0 0 1/ 2
siguiente
= EB
actual
1 0 2 1 3 0 1 1 2
= 0 1 1 / 2 0 1 0 = 0 1 / 2 1 / 2
0 0 1 / 2 0 1 1 0 1 / 2 1 / 2
Nueva solucin:
S1 1 1 2 60 10
X B = B b = X 1 0 1 / 2 1 / 2 10 = 15
X 0 1 / 2 1 / 2 20 5
2
1
C BT B 1
Z=
1 1 2
= (0 2 1) 0 1 / 2 1 / 2 = (0 3 / 2 1 / 2 )
0 1/ 2 1/ 2
C BT B 1b
60
= (0 3 / 2 1 / 2 ) 10 = 25
20
Prueba de optimalidad:
C BT B 1a j
Cj
j = X 3, S 2, S 3
1 0 0
= (0 3 / 2 1 / 2 ) 2 1 0 (1 0 0 ) = (3 / 2 3 / 2 1 / 2 )
1 0 1
Ejercicio 2.12
Sea el problema siguiente, resolver por el mtodo simplex revisado.
Max Z =
S.a:
3X1 + 2X2
X1 + 2X2
2X1 + X2
-X1 + X2
X2
X1, X2 0
6
8
1
2
Max Z =
S.a:
X1 +2X2 + S1
2X1 + X2
+ S2
-X1 + X2
+ S3
X2
+ S4
X1, X2, S1, S2, S3, S4 0
=
=
=
=
6
8
1
2
Solucin inicial:
B 1
0
=
0
C BT B 1
0
1
0
0
0
0
1
0
0
0
0
= (0 0 0 0)
0
0
1
XB = B b =
0
0
1
0
0
0
1
0
0
0
0
1
0
0 6
0 8
0 1
1 2
0
= (0 0 0 0)
0
0
0
1
0
1 2
2 1
T 1
C B B a j C j j = X 1, X 2 = (0 0 0 0)
(3 2 ) = ( 3 2 )
1 1
0 1
1/ 2
1/ 2
=
1/ 2
1 1/ 2
0 1/ 2
E =
0 1/ 2
0
0
0
0
1
0
0
0
B 1 siguiente = EB 1 actual
1 1/ 2
0 1/ 2
=
0 1/ 2
0
0
Nueva solucin:
S1 1 1 / 2
X 0 1 / 2
1
X B = B b = 1
S
0 1/ 2
3
S 0
0
4
0
0
1
0
0 1
0 0
0 0
1 0
0
1
0
0
0
0
1
0
0 1 1/ 2
0 0 1/ 2
=
0 0 1/ 2
1 0
0
0
0
1
0
0
0
0 0 6 2
0 0 8 4
=
1 0 1 5
0 1 2 2
1 1/ 2 0 0
0 1/ 2 0 0
T 1
C B B = (0 3 0 0)
= (0 3 / 2 0 0 )
0 1/ 2 1 0
0
0
0
1
6
8
T 1
Z = C B B b = (0 3 / 2 0 0 ) = 12
1
2
Prueba de optimalidad:
2 0
1 1
T 1
C B B a j C j j = X 2, S 2 = (0 3 / 2 0 0 )
(2 0 ) = ( 1 / 2 3 / 2)
1 0
1 0
1 1/ 2
0 1/ 2
1
B a2 =
0 1/ 2
0
0
0
0
1
0
0 2 3 / 2
0 1 1 / 2
=
0 1 3 / 2
1 1 1
4
5 2
2
,
,
Se elige como variable de salida a S1 ( r = 1 ), ya que es la mnima de
,
3 / 2 1/ 2 3 / 2 1
Aplicando la forma producto.
2/3
1/ 3
=
1
2 / 3
2/3
1/ 3
E =
1
2/3
B 1 siguiente = EB 1 actual
0
1
0
0
0
0
1
0
2/3
1/ 3
=
1
2/3
Nueva solucin:
X 2 2 / 3 1 / 3
1 / 3 2 / 3
1
X B = B 1b =
S 1
1
3
S 2 / 3 1 / 3
4
0
1
0
0
0
0
1
0
0
1
0
0 1 1 / 2
0 0 1 / 2
0 0 1 / 2
0
1 0
0
0
1
0
0 2 / 3 1/ 3
0 1/ 3 2 / 3
=
1
0 1
1 2 / 3 1/ 3
0
0
1
0
0
0
0 0 6 4 / 3
0 0 8 10 / 3
=
1 0 1 3
0 1 2 2 / 3
2 / 3 1/ 3 0 0
1/ 3 2 / 3 0 0
T 1
C B B = (2 3 0 0)
= (1 / 3 4 / 3 0 0 )
1
1
1 0
2 / 3 1/ 3 0 1
6
8
T 1
Z = C B B b = (1 / 3 4 / 3 0 0) = 38 / 3
1
2
Prueba de optimalidad:
1 0
0
1
C BT B 1a j C j j = S1, S 2 = (1 / 3 4 / 3 0 0)
(0 0 ) = (1 / 3 4 / 3)
0 0
0 0
40
60
30
+0S2 +0S3
=
4X1 - 2X2 + 3X3 - S1 + A1
2X1 + 4X2 + X3
+ S2
=
3X1 + X2 - 2X3
+ S3 =
X1, X2, X3, S1, S2, S3, A1 0
40
60
30
X2
-6
-2
4
1
X3
-1/2
3
1
-2
S1
0
-1
0
0
A1
M
1
0
0
S2
0
0
1
0
S3
0
0
0
1
Solucin
0
40
60
30
Tabla 2.37
X1
-4M-4
Z
A1
S2
S3
4
2
3
X2
2M-6
-2
4
1
X3
-3M1/2
3
1
-2
S1
M
A1
0
S2
0
S3
0
Solucin
-40M
-1
0
0
1
0
0
0
1
0
0
0
1
40
60
30
X2
-8
-1/2
5
5/2
X3
5/2
3/4
-1/2
-17/4
S1
-1
-1/4
1/2
3/4
A1
M+1
1/4
-1/2
-3/4
S2
0
0
1
0
S3
0
0
0
1
Solucin
40
10
40
0
Tercera iteracin: Entra la variable X3 que es la nica negativa, y Sale la nica que puede
salir que es S2.
Tabla 2.39
X1
Z
0
X2
0
X3
111/10
-1/10
8
-17/10
S1
7/5
A1
M-7/5
S2
0
S3
16/5
Solucin
40
-1/10
-1
3/10
1/10
1
-3/10
0
1
0
1/5
-2
2/5
10
40
0
X1
S2
X2
1
0
0
0
0
1
Z
X1
X3
X2
X1
0
1
0
0
11
Solucin
191/2
21/2
5
17/2
Ejercicio 2.14
Resolver el siguiente problema de P.L.
Max Z =
S.a:
6X1 + 4X2
+ 3X3 + 2X4
+0S2
- S2
=
=
=
400
150
200
X1
-6
2
1
2
X2
-4
3
1
1
X3
-3
1
2
2
X4
-2
2
1
1/2
S1
0
1
0
0
A1
M
0
1
0
A2
M
0
0
1
S2
0
0
0
-1
Sol.
0
400
150
200
X1
-3M-6
2
1
2
X2
-2M-4
3
1
1
X3
-4M-3
1
2
2
X4
-3/2M-2
2
1
1/2
S1
0
1
0
0
A1
0
0
1
0
A2
0
0
0
1
S2
M
0
0
-1
Sol.
-350M
400
150
200
Tabla 2.43
Z
S1
X3
A2
X1
-M-9/2
3/2
1/2
1
X2
-5/2
5/2
1/2
0
X3
0
0
1
0
X4
M/2-1/2
3/2
1/2
-1/2
S1
0
1
0
0
A1
2M+3/2
-1/2
1/2
-1
A2
0
0
0
1
S2
M
0
0
-1
Sol.
-50M+225
325
75
50
X1
0
0
0
1
X2
-5/2
5/2
1/2
0
Z
S1
S2
X1
X1
0
0
0
1
X2
2
1
1
1
X3
0
0
1
0
X4
-11/4
9/4
3/4
-1/2
S1
0
1
0
0
A1
M-3
1
1
-1
A2
M+9/2
-3/2
-1/2
1
S2
-9/2
3/2
1/2
-1
Sol.
450
250
50
50
S2
0
0
1
0
Sol.
900
100
100
150
X4
4
0
3/2
1
S1
0
1
0
0
A1
M+6
-2
2
1
A2
M
0
-1
0
+ 2X2
X3
+ 4X2 + 6X3 25
+ 2X2 - X3 30
- 2X2 + X3 = 15
X1, X2, X3 0
X2
-2
4
2
-2
X3
1
6
-1
1
S1
0
-1
0
0
A1
-M
1
0
0
S2
0
0
1
0
A2
-M
0
0
1
Sol.
0
25
30
15
X2
2M-2
4
2
-2
X3
7M+1
6
-1
1
S1
-M
-1
0
0
A1
0
1
0
0
S2
0
0
1
0
A2
0
0
0
1
Solucin
40M
25
30
15
X3
S2
A2
2/3
14/3
1/3
X2
8M 8
3
2/3
8/3
-8/3
X3
0
S1
1
0
0
-1/6
-1/6
1/6
M +1
6
A1
7 M 1
6
1/6
1/6
-1/6
S2
0
A2
0
Solucin
0
1
0
0
0
1
25/6
205/6
65/6
65M 25
6
1
0
0
X2
X3
-3M-
3/2
M 7
+
2
4
1
-2
-3
3/2
-7
-1/2
S1
M 1
4 8
-1/4
1
1/4
14
A1
5M 1
+
4
8
1/4
-1
-1/4
S2
0
A2
0
Solucin
0
1
0
0
0
1
25/4
5
35/4
35M 25
+
4
8
1
0
0
X2
X3
5M 7
2
4
5M 7
+
4
8
1/2
-2
-5/2
-1/4
-7
5/4
S1
0
A1
-M
0
1
0
0
-1
0
S2
M 1
+
4
8
1/4
1
-1/4
A2
0
Solucin
0
0
1
15/2
5
15/2
15M 15
+
2
4
X1
S1
X3
Z
S2
S1
X3
1
0
0
X1
-3/2
5
2
1
0
-16
-2
0
0
1
0
1
0
0
-1
0
1/5
-2/5
-1/5
1/5
28/5
4/5
9
47
6
Solucin
-15
45
65
15
Variables
Utilidad
Cambiando celdas
Moldeado
Ensamble
Acabado
Compuesto
Produccin
X1
X2
X3
X4
160
0
124
18.666
212
0
170
3.5555
3
5
10
200
2
3
8
200
15
4
6
12
280
3
4
3
220
1
2919.1111
Disponible
48
96
160
4800
8
48
70.22222
160
4515.555
3.55555
H
4
5
6
7
8
9
10
=sumaproducto(B3:E3,B4:E4)
=sumaproducto(B$4:E$4,B6:E6)
=sumaproducto(B$4:E$4,B7:E7)
=sumaproducto(B$4:E$4,B8:E8)
=sumaproducto(B$4:E$4,B9:E9)
=sumaproducto(B$4:E$4,B10:E10)
16
01
5X1 + 4X2
6X1 + 4X2
X1 + 2X2
-X1 + X2
X2
X1, X2
Max. Z =
S.a:
60X1 + 60X2
Sol. ptima
24
6
1
2
0
Z = 21
X1 = 3
X2 = 3/2
02
+ 90X3 + 90X4
Sol. ptima
Z = 7950/7
X1 = 50/7
X2 = 0
X3 = 55/7
Min. Z =
S.a:
03
5A + 8B
4A + 10B 40
10A + 5B 50
7A + 7B 49
A, B 0
Min. Z =
S.a:
5X1 - 6X2
04
- 7X3
X1 + 5X2 - 3X3 15
5X1 - 6X2 +10X3 20
X1 + X2 + X3 = 5
X1, X2, X3 0
Max. Z =
S.a:
200X1 + 140X2
Sol. ptima
Z = 41
A=5
B=2
Sol. ptima
Z = -125/4
X1 = 0
X2 = 15/4
X3 = 5/4
05
+ 360X3
Sol. ptima
Z = 960
X1 = 3
X2 = 0
X3 = 1
Max. Z =
S.a:
3X1 + 2X2
06
+ 5X3
Min. Z =
S.a:
07
+ 14X2 + 21X3
+ 11X2 +
+ 2X2 +
+ 6X2 +
X1, X2, X3
15X1 + 18X2
X1 +
X1
9X3 12
7X3 14
3X3 10
0
08
+ 21X3
X2 +
X3
X2
X3
X1, X2, X3 0
Min. Z =
S.a:
4X1 + 10X2
= 1000
300
150
200
09
+ 5X3
2X1 +
6X1 +
X1 +
Min. Z =
S.a:
3X1
7X2 X3 45
8X2 + 7X3 10
3X2 + 4X3 = 30
X1, X2, X3 0
10
+ 6X2 + X3
4X1 - X2 + 3X3 18
X1 + 6X2 + 4X3 = 50
2X1 + 3X2 + X3 35
X1, X2, X3 0
18
Sol. ptima
Z = 21
X1 = 7
X2 = 0
X3 = 0
Sol. ptima
Z = 15
X1 = 3/2
X2 = 0
X3 = 0
Sol. ptima
Z = 17700
X1 = 300
X2 = 500
X3 = 200
Sol. ptima
Z = 305/3
X1 = 70/3
X2 = 0
X3 = 5/3
Sol. ptima
Z = 1566/25
X1 = 158/25
X2 = 182/25
X3 = 0
Min. Z =
S.a:
5X1 - 6X2
11
- 7X3
X1 + 5X2 - 3X3 15
5X1 - 6X2 + 10X3 20
X1 + X2 + X3 = 5
X1, X2, X3 0
Min. Z = 10X1
S.a:
8X1
2X1
9X1
Min. Z =
S.a:
12
+ 14X2 + 21X3
+ 11X2 + 9X3 12
+ 2X2 + 7X3 14
+ 6X2 + 3X3 10
X1, X2, X3 0
2X1 - 3X2
13
+ 6X3
14
3X1 + 2X2 + X3
4X1 + X2 + X3 16
X1 + 3X2 + 2X3 = 12
3X1 + 2X2 + X3 15
X1, X2, X3 0
Min. Z =
S.a:
15
3X1 + 2X2 + X3
6X1 + 2X2 + X3 16
X1 + 3X2 + 2X3 12
2X1 + X2 + 3X3 = 15
X1, X2, X3 0
19
Sol. ptima
Z = -125/4
X1 = 0
X2 = 15/4
X3 = 5/4
Sol. ptima
Z = 2506/57
X1 = 28/57
X2 = 0
X3 = 106/57
Sol. ptima
Z=9
X1 = 0
X2 = 4
X3 = 7/2
Sol. ptima
Z = 15
X1 = 3
X2 = 3
X3 = 0
Sol. ptima
Z = 141/16
X1 = 33/16
X2 = 0
X3 = 21/8
Min. Z =
S.a:
2X1 - 7X2
16
+ 4X3
Sol. ptima
Z = -1/34
X1 = 0
X2 = 95/34
X3 = 83/17
1/2X1 - X2 + 7X3 32
3X1 + 2X2 + 5X3 30
7X1 + 6X2 - 2X3 = 7
X1, X2, X3 0
Min. Z = 1/2X1
S.a:
4X1
4X1
X1
Min. Z =
S.a:
X1
+ 2X2
17
- X3
+ 4X2 + 6X3 25
+ 2X2 - X3 30
- 2X2 + X3 15
X1, X2, X3 0
- 2X2
18
- X3
2X1 + 7X2 + X3 13
- X1 + 8X2 + X3 9
4X1 + X2 - 3X3 1
X1, X2, X3 0
Max. Z =
S.a:
Sol. ptima
Z = -3/2
X1 = 9
X2 = 0
X3 = 6
Sol. ptima
Z = -43/11
X1 = 0
X2 = 20/11
X3 = 3/11
19
12X1 + 4X2 + 4.8X3 + 4X2
100X1 + 50X2 + 80X3
100X1
50X2
80X3
4X2
X1, X2, X3, X4 0
2000
1000
1000
1000
1000
20
- 4X3 + X4
50
40
70
20
Sol. ptima
Z = 220
X1 = 10
X2 = 0
X3 = 0
X4 = 25
Sol. ptima
Z = -180/11
X1 = 0
X2 = 0
X3 = 130/11
X4 = 340/11