max Z 2 1

c1 0 1 <=
c2 2 5 <=
c3 3 1 <=
c4 1 0 >=
c5 0 1 >=

45

40

35

30

25

20

15

B
10A C
Región
5 Factible

0 E D 15
0 5 10 20 25 30
15 c1 c2 c3 Z
10 x1 x2 x1 x2 x1 x2 x1 x2
60 0 10 30 0 14.6667 0 7.5 0
44 10 10 0 12 0 44 0 15
0 20 10
0 30 10

Punto A Z= 10
c1 0 1 = 10 x1 = 0
c4 1 0 = 0 x2 = 10

Punto B Z= 20
c1 0 1 = 10 x1 = 5
c2 2 5 = 60 x2 = 10

Punto C Z = 31.6923 Solución

c2 2 5 = 60 x1 = 12.3077 Óptima
c3 3 1 = 44 x2 = 7.07692 (Única)

Punto D Z = 29.3333
c3 3 1 <= 44 x1 = 14.6667
c5 0 1 >= 0 x2 = 0

Punto E Z= 0
c4 1 0 = 0 x1 = 0
30 c5 0 1 = 0 x2 = 0
Solución
 max Z 3 1
c1 0 1 <=
c2 2 5 <=
c3 3 1 <=
c4 1 0 >=
c5 0 1 >=

45

40

35

30

25

20

15

B
10A C
Región
5 Factible

0 E D 15
0 5 10 20 25 30
20 c1 c2 c3 Z
10 x1 x2 x1 x2 x1 x2 x1 x2
60 0 10 30 0 14.6667 0 6.66667 0
44 10 10 0 12 0 44 0 20
0 20 10
0 30 10

Punto A Z= 10
c1 0 1 = 10 x1 = 0
c4 1 0 = 0 x2 = 10

Punto B Z= 25
c1 0 1 = 10 x1 = 5
c2 2 5 = 60 x2 = 10

Punto C Z* = 44 Solución
c2 2 5 = 60 x*1 = 12.3077 Óptima
c3 3 1 = 44 x*2 = 7.07692 (Múltiples soluciones óp

Punto D Z* = 44 Solución
c3 3 1 = 44 x*1 = 14.6667 Óptima
c5 0 1 = 0 x*2 = 0

Punto E Z= 0
c4 1 0 = 0 x1 = 0
30 c5 0 1 = 0 x2 = 0
Solución

(Múltiples soluciones óptimas)

Solución
 max Z 10 20
c1 -1 2 <=
c2 1 1 <=
c3 5 3 <=
c4 1 0 >=
c5 0 1 >=

16

14

12

10 B

8 C
A

6
Región
Factible
4

0 E D
0 2 4 6 8 10 12
60 c1 c2 c3 Z
15 x1 x2 x1 x2 x1 x2 x1 x2
12 0 7.5 12 0 9 0 6 0
45 5 10 0 12 0 15 0 3
0 10 12.5
0

Punto A Z= 150
c1 -1 2 = 15 x1 = 0
c4 1 0 = 0 x2 = 7.5

Punto B Z* = 210 Solución

c1 -1 2 = 15 x*1 = 3 Óptima
c2 1 1 = 12 x*2 = 9 (Única)

Punto C Z= 195
c2 1 1 = 12 x1 = 4.5
c3 5 3 = 45 x2 = 7.5

Punto D Z = 146.667
c5 0 1 = 0 x1 = 14.6667
c3 3 1 = 44 x2 = 0

Punto E Z= 0
c4 1 0 = 0 x1 = 0
12 c5 0 1 = 0 x2 = 0
Solución
 max Z 750 500
c1 1 0 >=
c2 1 -2 <=
c3 150 100 <=
c4 1 0 >=
c5 0 1 >=

40

35

30
A
25

20

15 Región
Factible
B
10

5
C

0
0 5 10 15 20 25 30 35 40 45
 12,500 c1 c2 c3 Z
5 x1 x2 x1 x2 x1 x2 x1 x2
0 5 0 0 0 24 0 16.6667 0
3,600 5 20 15 7.5 0 36 0 25
0 5 40 25 12.5
0 35 17.5
45 22.5

Punto A Z* = 18,000 Solución

c1 1 0 = 5 x*1 = 5 Óptima
c3 150 100 = 3,600 x*2 = 28.5 (Múltiples soluciones óp

Punto B Z* = 18,000 Solución

c3 150 100 = 3,600 x*1 = 18 Óptima
c2 1 -2 = 0 x*2 = 9

Punto C Z= 5000
c1 1 0 >= 5 x1 = 5
c2 1 -2 = 0 x2 = 2.5

40 45
Solución

(Múltiples soluciones óptimas)

Solución
 max Z 700 900
c1 1 0 >=
c2 1 -2 <=
c3 150 100 >=
c4 1 0 >=
c5 0 1 >=

40

35

30
Región
Factible
25

20

15

10

0
0 5 10 15 20 25 30 35 40 45
 28,500 c1 c2 c3 Z
5 x1 x2 x1 x2 x1 x2 x1 x2
0 5 0 0 0 24 0 40.7143 0
3,600 5 20 15 7.5 0 36 0 31.6667
0 5 40 25 12.5
0 35 17.5
45 22.5

Problema No-Acotado
No tiene solución óptima

40 45
 max Z 10 9
c1 4 5 <=
c2 11 10 <=
c3 1 0 <=
c4 0 1 <=
c4 1 0 >=
c5 0 1 >=
1.8

1.6

1.4

1.2

A
1
B

0.8

0.6
Región
0.4 Factible

0.2
C
E
0 D 1
0 0.2 0.4 0.6 0.8 1.2 1.4 1.6 1.8
 3.80 c1 c2 c3 c4 Z
7 x1 x2 x1 x2 x1 x2 x1 x2 x1 x2
12 1.75 0 1.09091 0 1 0 0 1 0.38 0
1 0 1.4 0 1.2 1 1.5 1.5 1 0 0.42222
1
0
0 Punto A Z = 9.000
c4 0 1 = 1 x1 = 0.0
c4 1 0 >= 0 x2 = 1.0

Punto B Z = 10.818
c2 11 10 = 12 x1 = 0.18
c4 0 1 = 1 x2 = 1.0
Solución Óptim
Punto C Z* = 10.900
c2 11 10 = 12 x*1 = 1.0
Ser socio pleno e
c3 1 0 = 1 x*2 = 0.1 Opción 1, e invert
10% (una décima p
Punto D Z = 10.000 en la Opción 2
c5 0 1 = 0 x1 = 1.0
c3 1 0 = 1 x2 = 0.0

Punto E Z = 0.000
c4 1 0 = 0 x1 = 0.0
c5 0 1 = 0 x2 = 0.0
1.6 1.8
 Solución Óptima

Ser socio pleno en la

Opción 1, e invertir al
10% (una décima parte)
en la Opción 2.
 max Z 40 50
c1 2 3 >=
c2 1 1 >=
c3 2 1 >=
c4 1 0 >=
c5 0 1 >=

20
A

18

16

14 Región
Factible
12

10

B
4

0
0 2 4 6 8 10 12 14 C 16 18 20
 1,080 c1 c2 c3 Z
30 x1 x2 x1 x2 x1 x2 x1 x2
12 15 0 12 0 10 0 27 0
20 0 10 0 12 0 20 0 21.6
0
0

Punto A Z = 1000
c3 2 1 = 20 x1 = 0
c4 1 0 = 0 x2 = 20

Punto B Z= 550 Solución

c3 2 1 = 20 x1 = 7.5 Óptima
c1 2 3 = 30 x2 = 5 (Única)

Punto C Z= 600
c1 2 3 = 30 x1 = 15
c5 0 1 = 0 x2 = 0

18 20
Solución
 max Z 40 70
c1 2 3 >=
c2 1 1 >=
c3 2 1 >=
c4 1 0 >=
c5 0 1 >=

20
A

18

16

14 Región
Factible
12

10

6 B

0
0 2 4 6 8 10 12 14 C 16 18 20
 1,320 c1 c2 c3 Z
30 x1 x2 x1 x2 x1 x2 x1 x2
12 15 0 12 0 10 0 33 0
20 0 10 0 12 0 20 0 18.8571
0
0

Punto A Z = 1400
c3 2 1 = 20 x1 = 0
c4 1 0 = 0 x2 = 20

Punto B Z= 650
c3 2 1 = 20 x1 = 7.5
c1 2 3 = 30 x2 = 5
Nueva
Punto C Z= 600 Solución
c1 2 3 = 30 x1 = 15 Óptima
c5 0 1 = 0 x2 = 0 (Única)

18 20
Solución
 max Z 40 50
c1 2 3 >=
c2 1 1 >=
c3 2 1 >=
c4 1 0 >=
c5 0 1 >=

20

18

16
A
14 Región
Factible
12

10 B

6
C
4

0 D 16
0 2 4 6 8 10 12 14 18 20
 1,080 c1 c2 c3 Z
30 x1 x2 x1 x2 x1 x2 x1 x2
12 15 0 12 0 7.5 0 27 0
15 0 10 0 12 0 15 0 21.6
0
0

Punto A Z= 750
c3 2 1 = 15 x1 = 0
c4 1 0 = 0 x2 = 15

Punto B Z= 570
c3 2 1 = 15 x1 = 3
c2 1 1 = 12 x2 = 9

Punto C Z= 540 Solución

c1 2 3 = 30 x1 = 6 Óptima
c2 1 1 = 12 x2 = 6 (Única)

Punto D Z= 600
c1 2 3 = 30 x1 = 15
c5 0 1 = 0 x2 = 0

18 20
Solución
16

14

12

10

0
0 2 4 6 8 10 12 14 16
c1 c2
x1 x2 x1 x2
12 0
0 7.5 0 12
5 10
10 12.5
15 15