Académique Documents
Professionnel Documents
Culture Documents
SUJETA A:
Z = 13 X1 + 16 X2
5 X1 + 5 X2 <= 35
6 X1 + 9 X2 <= 54
X2 >= 2
Xj >= 0
5 X1 + 5 X2 + X3 = 35
6 X1 + 9 X2 + X4 = 54
X2 - X5 = 2
(11M + 13) X1 + (15M + 16) X2 + MX3 + MX4 - MX5 - 91M
SUSTITUYENDO LA M POR 1000:
MAXIMIZAR Z =
SUJETA A:
7
6
2
V BAS
X6
X7
X8
X1
5
6
0
-11013
X2
5
9
1
-15016
X3
1
0
0
-1000
X4
0
1
0
-1000
Cj
0
0
15016
5
4
-
V BAS
X6
X7
X2
X1
5
6
0
-11013
X2
0
0
1
X3
1
0
0
-1000
X4
0
1
0
-1000
Cj
0
-1000
15016
3
6
9
V BAS
X1
X6
1.66667
X5
0.66667
X2
0.66667
-1669
X2
0
0
1
X3
1
0
0
-1000
X4
-0.5556
0.11111
0.11111
557.333
Cj
11013
-1000
15016
V BAS
X1
X5
X2
X2
0
0
1
X3
0.6
-0.4
-0.4
1.4
X4
-0.3333
0.33333
0.33333
1
X1
1
0
0
CTLFSNNOCSTEPPLT:
X1
X5
X2
Z=
MAXIMA:
Z=
3
2
4
5 X1 + 5 X2 + X3 + X6 =
6 X1 + 9 X2 + X4 + X7 =
X2 - X5 + X8 = 2
Z = 13 X1 + 16 X2
103
5 - 91000
X5
0
0
-1
1000
X6
1
0
0
X7
0
1
0
X8
0
0
1
b
35
54
2
X5
5
9
-1
-14016
X6
1
0
0
X7
0
1
0
X8
-5
-9
1
15016
b
25
36
2
X5
0
1
0
X6
1
0
0
X7
-0.5556
0.11111
0.11111
1557.33
X8
0
-1
0
1000
b
5
4
6
X6
X7
0.6
-0.3333
-0.4
0.33333
-0.4
0.33333
1001.4
1001
X8
0
-1
0
1000
b
3
2
4
X5
0
1
0
5 X1 + 5 X2 <= 35
6 X1 + 9 X2 <= 54
5 X1 + 5 X2 + X3 + X6 = 35
6 X1 + 9 X2 + X4 + X7 = 54
X2 - X5 + X8 = 2
Z = 13 X1 + 16 X2
X1 + 3X3 -X6 51
7X2 + 4X3 - X7 83
19X1 -8X2 + X3 22
7X1 -12X2 0
Xj 0
Se le agrega una variable de holgura
8X1 -7X2 + 4X3 + X4 + X8 = 28
X1 + 9X2 + X5 + X9 = 81
X1 + 3X3 -X6 + X10 = 51
7X2 + 4X3 - X7 + X11 = 83
19X1 -8X2 + X3 + X12 = 22
7X1 -12X2 + X13 = 0
Cj
0
0
0
0
0
0
V bas
X8
X9
X10
X11
X12
X13
X1
8
1
1
0
19
7
###
X2
-7
9
0
7
-8
-12
X3
4
0
3
4
1
0
X4
1
0
0
0
0
0
X5
0
1
0
0
0
0
X6
0
0
-1
0
0
0
X7
0
0
0
-1
0
0
X8
1
0
0
0
0
0
X9
0
1
0
0
0
0
X10
0
0
1
0
0
0
X11
0
0
0
1
0
0
X12
0
0
0
0
1
0
X13
0
0
0
0
0
1
b
28
81
51
83
22
0
Cj
0
0
0
0
0
0
3.5
81
51
1.15789
0
V bas
X8
X9
X10
X11
X12
X13
X1
8
1
1
0
19
7
-36008
X2
-7
9
0
7
-8
-12
17093
X3
4
0
3
4
1
0
-12009
X4
1
0
0
0
0
0
-1000
X5
0
1
0
0
0
0
-1000
X6
0
0
-1
0
0
0
-1000
X7
0
0
0
-1
0
0
Cj
0
0
0
0
36008
0
5.2353
-1517
16.911
20.75
22
22
V bas
X8
X9
X10
X11
X1
X13
X1
0
0
0
0
1
0
X2
-3.63158
9.42105
0.42105
7
-0.42105
-9.05263
1931.74
X3
3.5789473684
-0.052631579
2.9473684211
4
0.0526315789
-0.368421053
-10113.84211
X4
1
0
0
0
0
0
-1000
X5
0
1
0
0
0
0
-1000
X6
0
0
-1
0
0
0
-1000
X7
0
0
0
-1
0
0
X8
1
0
0
0
0
0
X9
0
1
0
0
0
0
X10
0
0
1
0
0
0
X11
0
0
0
1
0
0
X12
0
0
0
0
1
0
X13
0
0
0
0
0
1
b
28
81
51
83
22
0
X8
1
0
0
0
0
0
X9
0
1
0
0
0
0
X10
0
0
1
0
0
0
X11
0
0
0
1
0
0
X12
-0.42105
-0.05263
-0.05263
0
0.05263
-0.36842
1895.16
X13
0
0
0
0
0
1
b
18.7
79.8
49.8
83
1.16
-8.11
0.279412
0 -0.11765
0 5.24
8 -- 6
Resulvase este problema de minimizacin
Minimizar: Z = 8X1 + 5X2 + 7X3
Restricciones:
10X1 + 8X2 + 12X3 120
2X1+ 4X2 -3X3 16
Xi 0, i=1,2,3
Agregando variable artificial
10X1 + 8X2 + 12X3 + X4 = 120
2X1+ 4X2 -3X3 - X5 = 16
Se agregan las M
(12M - 8)X1 + (12M - 5)X2 + (9M - 7)X3 + MX4 - MX5 - 136M
M=1000
Maximizar
Sujeta a:
Z=
11992X1 + 11995X2 + 8993X3 + 1000X4 - 1000X5 - 136000
10X1 + 8X2 + 12X3 + X4 120
2X1+ 4X2 -3X3 - X5 16
Variable de holgura
10X1 + 8X2 + 12X3 + X4 + X6 = 120
2X1+ 4X2 -3X3 - X5 + X7 = 16
Cj
0
0
15
4
V bas
X6
X7
X1
10
2
-11992
X2
8
4
-11995
X3
12
-3
-8993
X4
1
0
-1000
X5
0
-1
1000
X6
1
0
X7
0
1
Cj
0
11995
4.888889
-5.33333
V bas
X6
X2
X1
6
0.5
-5994.5
X2
0
1
X3
18
-0.75
-17989.25
X4
1
0
-1000
X5
2
-0.25
-1998.75
X6
1
0
X7
-2
0.25
2998.75
Cj
8993
11995
88
184
V bas
X3
X2
X1
0.333333333
0.75
1.916666667
X2
0
1
X3
1
0
Cj
1000
11995
V bas
X4
X2
X1
6
0.5
5.5
X2
0
1
X3
18
-0.75
10.75
X1= 0
X2= 4
X3= 0
X4= 88
X5= 0
Zmn=
8(0)+5(4)+7(0)=
10(0)+8(4)+12(0) 120
2(0)+4(4)-3(0) 16
X4
X5
X6
X7
0.0555556 0.1111111 0.055556 -0.111111
0.0416667 -0.166667 0.041667 0.166667
-0.5972222 0.0555556 999.4028 999.9444
X4
1
0
X5
2
-0.25
1.25
X6
1
0
1000
X7
-2
0.25
998.75
-20
20
32
20
10(0)+8(4)+12(0)+88 = 120
2(0)+4(4)-3(0)-0 = 16
11992(0)+11995(4)+8993(0)+1000(88)-1000(0)-136000
10(0)+8(4)+12(0)+88+0= 120
2(0)+4(4)-3(0)-0+0= 16
8 --7
Resulvase el siguiente problema de minimizacin y explquese la solucin
Minimizar
Z=8X1 + 12X2 + 4X3
Sujeta a:
X1 + X2 + X3 30
2X1 + 3X2 + X3 12
Xi0, i=1,2,3
Agregando variable artificial
X1 + X2 + X3 + X4 = 30
2X1 + 3X2 + X3 - X5 = 12
Se agregan las M
(3M - 8)X1 + (4M - 12)X2 + (2M - 4)X3 + MX4 + MX5 - 32M
M=1000
MINIMIZAR Z=
Variable de holgura
X1 + X2 + X3 + X4 + X6 30
2X1 + 3X2 + X3 - X5 + X7 12
Z=-20
Cj
0
0
30
4
V bas
X6
X7
X1
1
2
-2992
X2
1
3
-3988
X3
1
1
-1996
X4
1
0
-1000
X5
0
-1
1000
X6
1
0
X7
0
1
Cj
0
3988
39
-
V bas
X6
X2
X1
0.333333333
0.666666667
-333.333333
X2
0
1
X3
0.6666667
0.3333333
-666.66667
X4
1
0
-1000
X5
0.3333333
-0.333333
-329.3333
X6
1
0
X7
-0.333333
0.333333
1329.333
Cj
1000
3988
V bas
X4
X2
X1
0.333333333
0.666666667
0
X2
0
1
X3
0.6666667
0.3333333
0
X4
1
0
X5
0.3333333
-0.333333
4
X6
1
0
1000
X7
-0.333333
0.333333
996
X1=
X2
X3
X4
X5
0
0
0
0
0
-48
Zmn= 8(0)+12(4)+4(0)=
(0)+(4)+(0) 30
2(0)+3(4)+(0) 12
48
2992(0)+3988(4)+1996(0)+1000(26)-1000(0)-42000
Zmn=
-48
8 -- 8
Resulvase el siguiente problema y explquese la solucin
Maximizar: Z=10X1 + 8X2 + 14X3
Sujeta a:
5X1 + 4X2 + 7X3 70
2X1 + X2 + 3X3 15
Xi=0 i=1,2,3
Se le agrega la variable artificial
5X1 + 4X2 + 7X3 + X4 = 70
2X1 + X2 + 3X3 -X5 = 15
Se agregan las M
(7M + 10)X1 + (5M + 8)X2 + (10M + 14)X3 + X4M - X5M - 85M
M=1000
Se sustituye la M
7010X1 + 5008X2 + 10014X3 + 1000X4 -1000X5 - 85000
Maximizar:
Z=
Variable de holgura
5X1 + 4X2 + 7X3 + X4 + X6 = 70
2X1 + X2 + 3X3 -X5 + X7 = 15
Cj
0
0
10
5
V bas
X6
X7
X1
5
2
-7010
X2
4
1
-5008
X3
7
3
-10014
X4
1
0
-1000
X5
0
-1
1000
X6
1
0
X7
0
1
Cj
0
10014
15
-15
V bas
X6
X3
X1
0.333333333
0.666666667
-334
X2
1.6666666667
0.3333333333
-1670
X3
0
1
X4
1
0
-1000
X5
2.3333333
-0.333333
-2338
X6
1
0
X7
-2.333333
0.333333
3338
Cj
-1000
10014
V bas
X5
X3
X1
0.142857143
0.714285714
0
X2
0.7142857143
0.5714285714
0
X3
0
1
X4
0.4285714
0.1428571
2
X5
1
0
X6
0.428571
0.142857
1002
X7
-1
0
1000
X1
X2
X3
X4
X5
0
0
10
0
15
Zmax=
10(0)+8(0)+14(10)
5(0)+4(0)+7(10) 70
2(0)+(0)+3(10) 15
=
=
=
140
70
30
5(0)+4(0)+7(10)+(0)= 70
2(0)+(0)+3(10)-(15)= 15
=
=
70
15
7010(0)+5008(0)+10014(10)+1000(0)-1000(15)-85000
5(0)+4(0)+7(10)+(0) 70
2(0)+(0)+3(10)-(15) 15
140
70
15
8 -- 9
a) Resulvase el siguiente problema con el mtodo simplex y explquese la respuesta
Maximizar
Z= 3X1 + 4X2
Restricciones
5X1 + 10X2 50
7X1 + 7X2 49
8X1 - 2X2 8
X1,X2 0
10
7
1
V bas
X6
X7
X8
X1
5
7
8
-20003
X2
10
7
-2
-15004
X3
1
0
0
-1000
X4
0
-1
0
1000
X5
0
0
1
-1000
X6
1
0
0
X7
0
1
0
Cj
0
0
20003
4
4.8
-4
V bas
X6
X7
X1
X1
0
0
1
X2
11.25
8.75
-0.25
-20004.75
X3
1
0
0
-1000
X4
0
-1
0
1000
X5
-0.625
-0.875
0.125
1500.375
X6
1
0
0
X7
0
1
0
Cj
15004
0
20003
V bas
X2
X7
X1
X1
0
0
1
X2
1
0
0
X3
0.0888889
-0.7777778
0.0222222
778.2
X4
0
-1
0
1000
=
=
=
22
50
42
X1= 2
X2= 4
X3= 0
X4= 0
X5= 0
X6= 0
Zmax= 3(2)+4(4)
5(2)+10(4) 50
7(2)+7(4) 49
8X1 - 2X2 8
X5
X6
-0.055556 0.088889
-0.388889 -0.777778
0.1111111 0.022222
389
1778.2
X7
0
1
0
X7= 7
X8= 0
b) Hgase una grfica de este problema y sombrese la regin factible
No tiene solucin el problema porque no satisface las desigualdades.
8 -- 10
Resulvase el siguiente problema de PL con el mtodo simplex y explquese la solucin
Maximizar:
Z= 10X1 + 8X2
Restricciones:
7X1 + 4X2 35
3X1 2X2 + 3
X1,X2 0
Se le agrega la variable artificial
7X1 + 4X2 - X3 = 35
3X1 -2X2 + X4 = 3
Se le agregan las M
(10M + 10)X1 + (2M + 8)X2 - MX3 + MX4 - 38M
M=1000
Se sustituye M
10010X1 + 2008X2 - 1000X3 + 1000X4 -38000
Cj
0
0
5
1
V bas
X5
X6
X1
7
3
-10010
X2
4
-2
-2008
X3
-1
0
1000
X4
0
1
-1000
X5
1
0
X6
0
1
b
35
3
Cj
0
10010
3.230769
-1.5
V bas
X5
X1
X1
0
1
X2
8.6666666667
-0.6666666667
-8681.333333333
X3
-1
0
1000
X4
-2.3333333
0.3333333
2336.6667
X5
1
0
X6
-2.333333
0.333333
3336.667
b
28
1
Cj
2008
10010
-28
-41
V bas
X2
X1
X1
0
1
X2
1
0
X3
X4
X5
X6
b
-0.1153846 -0.2692308 0.1153846 -0.269231 3.230769
-0.0769231 0.1538462 0.0769231 0.153846 3.153846
-1.6923077 -0.6153846 1001.6923 999.3846
8 -- 11
Resulvase el siguiente problema y comntese la solucin
Maximizar:
Z= 5X1 + 8X2 + 3X3
Restricciones:
X1 + X2 - 2X3 30
X1 + X2 + X3 20
X1 - 3X2 60
Xi 0, i=1,2,3
Se le agrega la variable artifical
X1 + X2 - 2X3 + X4 = 30
X1 + X2 + X3 +X5 = 20
X1 - 3X2 + X6 = 60
Se le agregan las M
(3M + 5)X1 + (-1M + 8)X2 + (-1M + 3)X3 + X4M + X5M + X6M - 110M
M=1000
Se sustituyen las M
Cj
0
0
0
30
20
60
V bas
X7
X8
X9
X1
1
1
1
-3005
X2
1
1
-3
992
X3
-2
1
0
997
X4
1
0
0
-1000
X5
0
1
0
-1000
X6
0
0
1
-1000
X7
1
0
0
Cj
0
3005
0
10
-
V bas
X7
X1
X9
X1
0
1
0
X2
0
1
-4
3997
X3
-3
1
-1
4002
X4
1
0
0
-1000
X5
-1
1
-1
2005
X6
0
0
1
-1000
X7
1
0
0
Cj
1000
3005
0
40
V bas
X4
X1
X9
X1
0
1
0
X2
0
1
-4
3997
X3
-3
1
-1
1002
X4
1
0
0
X5
-1
1
-1
1005
X6
0
0
1
-1000
X7
1
0
0
1000
Cj
1000
V bas
X4
X1
0
X2
0
X3
-3
X4
1
X5
-1
X6
0
X7
1
3005
1000
0.05
-0.1
X1
X6
1
0
1
-4
-3
1
-1
2
0
0
1
-1
5
0
1
0
0
1000
Cj
1000
-992
1000
V bas
X4
X2
X6
X1
0
1
4
3
X2
0
1
0
X3
-3
1
3
5
X4
1
0
0
X5
-1
1
3
8
X6
0
0
1
X7
1
0
0
1000
=
=
=
=
160
20
20
-60
=
=
=
30
20
60
X1
X2
X3
X4
X5
X6
X7
X8
X9
0
20
0
10
0
120
0
0
0
Zmax= 5(0)+8(20)+3(0)
(0)+(20)-2(0)30
(0)+(20)+(0) 20
(0)-3(20) 60
(0)+(20)-2(0)+(10)=30
(0)+(20)+(0)+(0)= 20
(0)-3(20)+(120)= 60
3005(0)-992(20)-997(0)+1000(10)+1000(0)+1000(120)-110000
(0)+(20)-2(0)+(10)+(0) 30
(0)+(20)+(0)+(0)+(0) 20
(0)-3(20)+(120)+(0) 60
=
=
=
=
30
20
60
8 -- 12
Resulvase este problema de minimizacin
Minimizar
Z= 4X1 + 6X2 + 4X3
Restricciones
3X1 + X2 + 4X3 36
2X1 + 4X2 + X3 40
X1,X2 0
Se sustituye las M
4996X1 + 4994X2 + 4996X3 - 1000X4 - 1000X5 - 76000
Se agregan las variables de holgura
3X1 + X2 + 4X3 - X4 + X6 36
2X1 + 4X2 + X3 - X5 + X7 40
Cj
0
0
12
20
V bas
X6
X7
X1
3
2
-4996
Cj
4996
0
36
4.8
V bas
X1
X7
X1
1
0
Cj
4996
4994
V bas
X1
X2
X1
1
0
X1= 10.4
X2= 4.8
X2
1
4
-4994
X3
4
1
-4996
X4
-1
0
1000
X5
0
1
1000
X6
1
0
X7
0
1
X5
0
1
1000
X6
0.333333
-0.666667
1665.333
X7
0
1
X4
-0.4
0.2
0.4
X5
-0.1
0.3
1998.6
X6
0.4
-0.2
999.6
X7
-0.1
0.3
998.6
=
=
70.4
36
X2
X3
X4
0.3333333333 1.3333333 -0.3333333
3.3333333333 -1.6666667 0.6666667
-3328.666666667 1665.3333 -665.33333
X2
0
1
X3
1.5
-0.5
1
Zmn= 4(10.4)+6(4.8)+4(0)
3(10.4)+(4.8)+4(0)36
X3= 0
X4= 0
X5= 0
X6= 0
X7= 0
2(10.4)+4(4.8)+(0) 40
40
3(10.4)+(4.8)+4(0)-(0)= 36
2(10.4)+4(4.8)+(0)-(0)= 40
=
=
36
40
4996(10.4)+4994(4.8)+4996(0)-1000(0)-1000(0)-76000
3(10.4)+(4.8)+4(0)-(0)+(0) 36
2(10.4)+4(4.8)+(0)-(0)+(0) 40
8 -- 13
Resulvase el siguiente problema y expliquese la solucin
Maximizar:
Z= 6X1 + 5X2
Restricciones:
3X1 + 9X2 27
10X1 + 3.75X2 37.5
5X1 + 5X2 25
X1,X2 0
36
40
-70.4
Cj
0
0
0
9
3.75
5
V bas
X6
X7
X8
X1
3
10
5
-18006
X2
9
3.75
5
-17755
X3
1
0
0
-1000
X4
0
1
0
-1000
X5
0
0
1
-1000
X6
1
0
0
X7
0
1
0
Cj
0
18006
0
2
10
2
V bas
X6
X1
X8
X1
0
1
0
X2
7.875
0.375
3.125
-11002.75
X3
1
0
0
-1000
X4
-0.3
0.1
-0.5
800.6
X5
0
0
1
-1000
X6
1
0
0
X7
-0.3
0.1
-0.5
1800.6
Cj
17755
18006
V bas
X2
X1
X1
0
1
X2
1
0
X3
X4
0.1269841 -0.0380952
-0.047619 0.1142857
X5
0
0
X6
X7
0.126984 -0.038095
-0.047619 0.114286
X8
-0.3968254 -0.3809524
397.1746 381.44762
Cj
17755
18006
1000
V bas
X2
X1
X5
X1
0
1
0
X2
1
0
0
X3
0.1269841
-0.047619
-0.3968254
0.3492063
X1= 3
X2= 2
X3= 0
X4= 0
X5= 0
X6= 0
X7= 0
X8= 0
Zmax= 6(3)+5(2)
3(3)+9(2) 27
10(3)+3.75(2) 37.5
5(3)+5(2) 25
3(3)+9(2)+(0)= 27
10(3)+3.75(2)+(0)= 37.5
5(3)+5(2)+(0)= 25
1
-1000
-0.396825 -0.380952
1397.175 1381.448
X4
-0.0380952
0.1142857
-0.3809524
0.4952381
X5
0
0
1
X6
X7
0.126984 -0.038095
-0.047619 0.114286
-0.396825 -0.380952
1000.349 1000.495
=
=
=
=
28
27
37.5
25
=
=
=
27
37.5
25
18006(3)+17755(2)+1000(0)+1000(0)+1000(0)-89500
38(3)+9(2)+(0)+(0) 27
1083)+3.75(2)+(0)+(0) 37.5
5(3)+5(2)+(0)+(0) 25
=
=
=
8 -- 14
Resulvase y comntese la solucin a este problema
Maximizar:
Z= 8X1 + 4X2 + 6X3
Restricciones
Cj
0
0
15
15
V bas
X6
X7
X1
4
2
-6008
X2
3
1
-4004
X3
5
0
-5006
X4
1
0
-1000
X5
0
1
-1000
X6
1
0
X7
0
1
Cj
6008
0
V bas
X1
X7
X1
1
0
X2
0.75
-0.5
502
X3
1.25
-2.5
2504
X4
0.25
-0.5
502
X5
0
1
-1000
X6
0.25
-0.5
1502
X7
0
1
Cj
6008
V bas
X1
X1
1
X2
0.75
X3
1.25
X4
0.25
X5
0
X6
0.25
X7
0
1000
X5
X1= 15
X2= 0
X3= 0
X4= 0
X5= 0
X6= 0
X7= 0
-0.5
2
Zmax=
-2.5
4
-0.5
2
8(15)+4(0)+6(0)
4(15)+3(0)+5(0) 60
2(15)+(0) 30
=
=
=
120
60
30
4(15)+3(0)+5(0)+(0)= 60
2(15)+(0)+(0)= 30
=
=
60
30
6008(15)+4004(0)+5006(0)+1000(0)+1000(0)-90000
4(15)+3(0)+5(0)+(0)+(0) 60
=
2(15) (0)+(0)+(0) 30
=
-0.5
1002
1
1000
=
60
30
8 -- 15
En la AAA Welding, Joe est tratando de decidir cuntas amarras para trailer debe de hacer para hacer un metal de desperdicio. Tiene dos tipos
metal y puede hacer cualquiera de dos tipos de ganchos. En la tabla siguiente se proporcionan los datos necesarios.
Requerido para:
Metal
Hierro Acanalado
Hierro Plano
Soldadura I
5
6
Soldadura II
5
9
Disponible
35 unidades
54 unidades
Joe gana $13 por cada gancho de tipo 1 y $16 por cada gancho de tipo 2. Ya prometi hacer 2 ganchos del tipo 2.
a) Resulvase este problema con el mtodo simplex.
b) Le han ofrecido a Jeo hierro acanalado adicional a $2 por unidad.
Deber de comprarlo?
c) Construyase el problema dual y resulvase.
b
120
16
b
88
4
b
4.88888889
7.66666667
b
88
4
b
30
12
b
26
4
b
26
4
b
70
15
b
35
5
b
15
10
X8
0
0
1
b
50
49
8
X8
-0.625
-0.875
0.125
2500.375
b
45
42
1
X8
-0.05555556
-0.38888889
0.11111111
1389
b
4
7
2
gualdades.
X8
0
1
0
X9
0
0
1
b
30
20
60
X8
-1
1
-1
3005
X9
0
0
1
b
10
20
40
X8
-1
1
-1
2005
X9
0
0
1
b
10
20
40
X8
-1
X9
0
b
10
1
-1
1005
0
1
1000
20
40
X8
-1
1
3
1008
X9
0
0
1
1000
b
10
20
120
160
b
36
40
b
12
16
b
10.4
4.8
X8
0
0
1
b
27
37.5
25
X8
0
0
1
b
15.75
3.75
6.25
X8
0
0
b
2
3
X8
0
0
1
1000
b
2
3
0
28
27
37.5
25
b
60
30
b
15
0
b
15
120
8 -- 8
Resulvase el siguiente problema y explquese la solucin
Maximizar: Z=10X1 + 8X2 + 14X3
Sujeta a:
5X1 + 4X2 + 7X3 70
2X1 + X2 + 3X3 15
Xi=0 i=1,2,3
se le agrega la variable artificial
5X1+4X2+7X3+X4=70
2X1+X2+3X3-X5=15
se agraegna las M
(7M+10)X1+(5M+8)X2+(10M+14)X3+MX4-X5M-M85
si M=1000
Z=7010X1+5008X2+1014X3+1000X4-100X5-85000
Maximizar Z=7010X1+5008X2+10014X3+1000X4-100X5-85000
5X1+4X2+7X3+X470
2X1+X2+3X3-X515
Variable De Holgura
5X1+4X2+7X3+X4+x6=70
2X1+X2+3X3-X5+x7=15
Cj
0
0
V bas
10 x6
5 x7
X1
Cj
0
10014
Cj
-1000
10014
X1
X2
V bas
15 X6
-15 X3
X2
5
2
-7010
X3
4
1
-5008
7
3
-10014
X1
X2
X3
0.33333333 1.66666667
0.66666667 0.33333333
-334
-1670
0
1
0
X1
X2
X3
0.14285714 0.71428571
0.71428571 0.57142857
0
0
0
1
0
V bas
X5
X3
0
0
Zmax=
10(0)+8(0)+14(10)
5(0)+4(0)+7(10) 70
X3
X4
X5
X6
X7
10
0
15
2(0)+(0)+3(10) 15
5(0)+4(0)+7(10)+(0)= 70
2(0)+(0)+3(10)-(15)= 15
7010(0)+5008(0)+10014(10)+1000(0)-1000(15)-85000
5(0)+4(0)+7(10)+(0) 70
2(0)+(0)+3(10)-(15) 15
X4
X5
1
0
-1000
X4
X6
0
-1
1000
X5
X6
1 2.33333333
0 -0.33333333
-1000
-2338
X4
X5
0.42857143
0.14285714
2
=
=
X7
1
0
0
1
70
15
X7
b
1 -2.33333333
0 0.33333333
3338
X6
X7
1 0.42857143
0 0.14285714
0
1002
140
70
35
5
b
-1
0
1000
15
10
0(15)-85000
30
=
=
70
15
140
70
15
8 -- 9
a) Resulvase el siguiente problema con el mtodo simplex y explquese la respuesta
Maximizar
Z= 3X1 + 4X2
Restricciones
5X1 + 10X2 50
7X1 + 7X2 49
8X1 - 2X2 8
X1,X2 0
10
7
1
V bas
X6
X7
X8
X1
5
7
8
-20003
X2
10
7
-2
-15004
X3
1
0
0
-1000
Cj
0
0
20003
4
4.8
-4
V bas
X6
X7
X1
X1
0
0
1
0
X2
11.25
8.75
-0.25
-20004.75
X3
1
0
0
-1000
Cj
15004
0
20003
V bas
X2
X7
X1
X1
0
0
1
0
x1
x2
X2
2
4
X3
1 0.0888888889
0 -0.7777777778
0 0.0222222222
0
778.2
Zmax= 3(2)+4(4)
x3
x4
x5
x6
x7
x8
0
0
0
0
7
0
5(2)+10(4) 50
7(2)+7(4) 49
8X1 - 2X2 8
quese la respuesta
X4
0
-1
0
1000
X5
0
0
1
-1000
X6
1
0
0
X7
0
1
0
X8
0
0
1
b
50
49
8
X4
0
-1
0
1000
X5
-0.625
-0.875
0.125
1500.375
X6
1
0
0
0
X7
0
1
0
0
X8
-0.625
-0.875
0.125
0
b
45
42
1
X4
X5
X6
X7
0 -0.05555556 0.08888889
-1 -0.38888889 -0.77777778
0 0.11111111 0.02222222
1000
389
1778.2
22
X8
b
0 -0.05555556
1 -0.38888889
0 0.11111111
0
1389
4
7
2
=
=
50
42
0
0
V bas
5 X5
1 X6
X1
Cj
V bas
0 3.23076923 X5
10010
-1.5 X1
Cj
2008
10010
V bas
-28 X2
-41 X1
X2
7
3
-10010
X1
X3
4
-2
-2008
X2
X3
0 8.66666667
1 -0.66666667
0 -8681.33333
X1
X2
0
1
0
-1
0
1000
-1
0
1000
X3
1 -0.11538462
0 -0.07692308
0 -1.69230769
y explquese la solucin
X4
X5
0
1
-1000
X4
X5
-2.33333333
0.33333333
2336.66667
X6
1
0
b
0
1
X6
b
1 -2.33333333
0 0.33333333
0 3336.66667
35
3
28
1
X4
X5
X6
b
-0.26923077 0.11538462 -0.26923077 3.23076923
0.15384615 0.07692308 0.15384615 3.15384615
-0.61538462 1001.69231 999.384615