jesus hinestroza x1 x2

santiago bonilla max Z 2 1

nathaly niño c1 0 1 <= 10

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

x2
40

35

30

25

20

15

10 A Punto óptimo
Región B
5 Factible

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 C 15 16 17 18 19 20 21 22 23 24
 c1 c2 c3 Z

x1 x2 x1 x2 x1 x2 x1 x2

0.0 10.0 0.0 12.0 0.0 44.0 6.5 0.0 13

10.0 10.0 2.0 11.2 2.0 38.0 0.0 13.0 13
15.0 10.0 10.0 8.0 10.0 14.0
20.0 10.0 18.0 4.8 12.0 8.0
25.0 10.0 30.0 0.0 14.7 0.0

Función Objetivo
Z 2 1 = 13

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

Punto B Z* = 32
c3 3 1 = 44 x1* = 12.3077
c2 2 5 = 60 x2* = 7.07692

Punto C Z= 29
c3 3 1 = 44 x1 = 14.6667
c5 0 1 = 0 x2 = 0
20 21 22 23 24 x1

El problema tiene una sola solución

 x1 x2
max Z 3 1
c1 0 1 <= 10
c2 2 5 <= 60
c3 3 1 <= 44
c4 1 0 >= 0
c5 0 1 >= 0

x2
40

35

30

25

20

15

10 A Punto óptimo
Región B
5 Factible
Punto óptimo
0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 C15 16 17 18 19 20 21 22 23 24
 c1 c2 c3 Z
x1 x2 x1 x2 x1 x2 x1 x2
0.0 10.0 0.0 12.0 0.0 44.0 5.7 0.0 17
10.0 10.0 2.0 11.2 2.0 38.0 0.0 17.0 17
15.0 10.0 10.0 8.0 10.0 14.0
20.0 10.0 18.0 4.8 12.0 8.0
25.0 10.0 30.0 0.0 14.7 0.0

Función Objetivo
Z 3 1 = 17

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

Punto B Z* = 44
c3 3 1 = 44 x1* = 12.3077
c2 2 5 = 60 x2* = 7.07692

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

20 21 22 23 24 x1

El problema tiene múltiples soluciones

 x1 x2
min Z 10 20
c1 1 0 <= 20
c2 0 1 <= 20
c3 20 20 <= 400
c4 10 10 >= 500
c5 1 1 >= 0

x2
40

35

30

25

20

15

10 REGION
5
FACTIBLE

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 c1 c2 c3 c4 Z
x1 x2 x1 x2 x1 x2 x1 x2 x1 x2
20.0 0.0 0.0 0.0 20.0 0.0 50.0 0.0
0.0 0.0 0.0 20.0 0.0 20.0 0.0 50.0

Función Objetivo
Z 10 20 = 150

Punto A Z= 200
c1 1 0 = 20 x1 = 20
c3 20 20 = 400 x2 = 0

Punto B Z* = 600
c1 1 0 = 20 x1* = 20
c2 0 1 = 20 x2* = 20

Punto C Z= 400
c2 0 1 = 20 x1 = 0
c3 20 20 = 400 x2 = 20

x1
20 21 22 23 24
El problema tiene una solución
 x1 x2
max Z 1 6
c1 1 0 >= 5
c2 0 1 >= 5
c3 2 -2 >= 20
c4 5 2 <= -20
c5 1 1 <= 0

40

35

30

25

20

15

10

0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 c1 c2 c3 Z
x1 x2 x1 x2 x1 x2 x1 x2
5.0 0.0 0.0 0.0 10.0 0.0 45.0 0.0 45
0.0 0.0 0.0 5.0 0.0 -10.0 0.0 7.5 45

Función Objetivo
Z 1 6 = 45

Punto A Z= 35
c1 1 0 = 5 x1 = 5
c2 0 1 = 5 x2 = 5

Punto B Z= 5
c1 1 0 = 5 x1 = 5
c5 0 1 = 0 x2 = 0

Punto C Z* = 72
c3 150 100 = 3,600 x1* = 18
c2 1 -2 = 0 x2* = 9

20 21 22 23 24 Punto D Z* = 24
c3 150 100 = 3,600 x1* = 24
c5 0 1 = 0 x2* = 0

El problema tiene múltiples soluciones

 x1 x2
max Z 750 900
c1 1 0 >= 5
c2 1 -2 <= 0
c3 150 100 <= 3,600
c4 1 0 >= 0
c5 0 1 >= 0

x2
40

35

30

25

20

15
Punto óptimo
10 C
A Región
5 Factible

0 B
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 c1 c2 c3 Z
x1 x2 x1 x2 x1 x2 x1 x2
5.0 0.0 0.0 0.0 0.0 36.0 21.0 0.0 15750
5.0 5.0 2.0 1.0 2.0 33.0 0.0 17.5 15750
5.0 15.0 10.0 5.0 10.0 21.0
5.0 40.0 18.0 9.0 12.0 18.0
30.0 15.0 24.0 0.0

Función Objetivo
Z 750 900 = 15,750

Punto A Z= 6,000
c1 1 0 = 5 x1 = 5
c2 1 -2 = 0 x2 = 2.5

Punto B Z= 3,750
c1 1 0 = 5 x1 = 5
c5 0 1 = 0 x2 = 0

Punto C Z* = 21,600
c3 150 100 = 3,600 x1* = 18
c2 1 -2 = 0 x2* = 9

Dx1 Punto D Z= 18,000

20 21 22 23 24
c3 150 100 = 3,600 x1 = 24
c5 0 1 = 0 x2 = 0

El problema tiene una solución

 Máx Z= x1(10'000.000) + x2(9'000.000) x1 x2
max Z 10,000,000 9,000,000
x1-> fracción 1er amigo c1 400 500 <=
x2-> fracción 1er amigo c2 $ 11,000,000 $ 10,000,000 <=
c3 1 0 >=
x1(400) + x2(500)<=700 c4 0 1 >=
x1(11'000.000) + x2(10'000.000)<=12'000.000
x1>=0
x2 x2>=0
2

A
1

Región
Factible
Punto óptimo
B
0
0 1
 c1 c2 Z
x1 x2 x1 x2 x1 x2
700 0.0 1.4 0.0 1.2 1.0 0.0
$ 12,000,000 1.0 0.6 1.0 0.1 0.0 1.1
0 1.5 0.2 1.09 0.0
0 1.6 0.1
1.8 0.0

Función Objetivo
Z $ 10,000,000 $ 9,000,000 =

Punto A
c3 1 0 =
c2 11000000 10000000 =

Punto B
c4 0 1 =
c2 11000000 10000000 =

2x1
 10000000
10000000

$ 10,000,000

Z= 10,800,000
0 x1 = 0
12000000 x2 = 1.2

Z= 10,909,091
0 x1 = 1.09090909
12000000 x2 = 0
 x1 x2
max Z 40 50
c1 2 3 >= 30
c2 1 1 >= 12
c3 2 1 >= 20
c4 1 0 >= 0
c5 0 1 >= 0

x2

40

35

30

25
A
20

15

10
Punto óptimo
5 B
C
0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 c1 c2 c3 Z
x1 x2 x1 x2 x1 x2 x1 x2
0.0 10.0 0.0 12.0 0.0 20.0 44.3 0.0 1770
2.0 8.7 2.0 10.0 2.0 16.0 0.0 35.4 1770
10.0 3.3 10.0 2.0 5 10.0
14.0 0.7 11.0 1.0 8.0 4.0
15.0 0.0 12.0 0.0 10.0 0.0

Función Objetivo
Z 40 50 = 1,770

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

Punto B Z* = 550
c3 2 1 = 20 x1* = 7.5
c1 2 3 = 30 x2* = 5

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

20 21 22 23 x1
24D
 x1 x2
max Z 40 70
c1 2 3 >= 30
c2 1 1 >= 12
c3 2 1 >= 20
c4 1 0 >= 0
c5 0 1 >= 0

x2

40

35

30

25
A
20

15

10
Punto óptimo
5 B
C
0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 c1 c2 c3 Z
x1 x2 x1 x2 x1 x2 x1 x2
0.0 10.0 0.0 12.0 0.0 20.0 56.8 0.0 2270
2.0 8.7 2.0 10.0 2.0 16.0 0.0 32.4 2270
10.0 3.3 10.0 2.0 5 10.0
14.0 0.7 11.0 1.0 8.0 4.0
15.0 0.0 12.0 0.0 10.0 0.0

Función Objetivo
Z 40 70 = 2,270

Punto A Z= 1,400
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

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

20 21 22 23 x1
24D
 x1 x2
max Z 10 20
c1 2 3 >= 30
c2 1 1 >= 12
c3 2 1 >= 15
c4 1 0 >= 0
c5 0 1 >= 0

x2
40

35

30

25 Región
Factible
20
A
15

B
10

5
C
0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

Punto óptimo
 c1 c2 c3 Z
x1 x2 x1 x2 x1 x2 x1 x2
0.0 10.0 0.0 12.0 0.0 15.0 44.3 0.0 442.5
2.0 8.7 2.0 10.0 2.0 11.0 0.0 35.4 708
10.0 3.3 10.0 2.0 5 5.0
14.0 0.7 11.0 1.0 6.0 3.0
15.0 0.0 12.0 0.0 7.5 0.0

Función Objetivo
Z 40 50 = 1,770

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* = 600
c1 2 3 = 30 x1* = 15
c5 0 1 = 0 x2* = 0

20 21 22 23 x1
24D