Scribd
Upload
59 views7 pages

Problama 1 Z 4.0 x1 + 5.0 x2

The document contains 9 problems involving linear programming optimization. Each problem shows a payoff function and multiple constraints. The optimal solutions are provided for variables x1 and x2.

Uploaded by

duro09
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX or read online on Scribd
59 views7 pages

Problama 1 Z 4.0 x1 + 5.0 x2

The document contains 9 problems involving linear programming optimization. Each problem shows a payoff function and multiple constraints. The optimal solutions are provided for variables x1 and x2.

Uploaded by

duro09
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX or read online on Scribd
You are on page 1/ 7

90

84

78

72
PROBLAMA 1
66

Z=4.0 x1 + 5.0 x2
60

54

48

42
r1: 2 .0 x 1 + 3 .0 x 2 = 1 2 0 .0

36

30
P ay o ff: 4 .0 x 1 + 5 .0 x 2 = 2 1 3 .3

24

18

12

6
r2: 2 .0 x 1 + 1 .5 x 2 = 8 0 .0

0
0 10 20 30 40 50 60 70 80 90 100 110 120 130

O p t im a l D e c is io n s ( x 1 ,x 2 ) : ( 2 0 .0 , 2 6 .7 )
r1: 2 .0 x 1 + 3 .0 x 2 < = 1 2 0 .0
r2: 2 .0 x 1 + 1 .5 x 2 < = 8 0 .0

Z=4.0 x1 + 5.0 x2
= 213.3
ACTIVA INACTIV REDUNDAN HOLGUR EXCEDEN
S AS TES A TES PD
r1: 2.0 x1 + 3.0 x2 <= 120.0 X / / / / 1.3
r2: 2.0 x1 + 1.5 x2 <= 80.0 X / / / / 0.7
a↑6.6 ^ b↑6
/a↓3.3^b↓3
24

PROBLEMA 3

Z=3.0 X1 + 1.0 X2
18

P ay o ff: 3 .0 X 1 + 1 .0 X 2 = 2 4 .0

12

r2: 3 .0 X 1 + 6 .0 X 2 = 4 2 .0

0 r1: 6 .0 X 1 + 4 .0 X 2 = 4 8 .0
0 10 20 30 40 50 60

O p t im a l D e c is io n s ( X 1 ,X 2 ) : ( 8 .0 , 0 .0 )
r1: 6 .0 X 1 + 4 .0 X 2 < = 4 8 .0
r2: 3 .0 X 1 + 6 .0 X 2 < = 4 2 .0

Z= 3.0 X1 + 1.0
X2 = 24.0
ACTIVA INACTIV REDUNDAN HOLGUR EXCEDEN
S AS TES A TES PD
r1: 6X1 + 4 X2 <= 48 X / / / / 0.5
r2: 3.0 X1 + 6.0 X2 <= 42.0 / X / 18 / 0
a↑∞ ^ b↑2
/a↓1.5^b↓0
102

96

90

84

78

72

PROBLEMA
66 5

Z=50.0
60
X1 + 20.0 X2
54

P a y o f f : 5 0 .0 X 1 + 2 0 .0 X 2 = 1 4 4 0 .0
48
R 1: 2 .0 X 1 - 1 .0 X 2 = 0 .0
42

36

30
R 3: 0 .9 X 1 + 0 .8 X 2 = 4 0 .0

24

18

12
R 2: 1 .0 X 1 + 4 .0 X 2 = 8 0 .0

0
0 10 20 30 40 50 60 70 80 90 100 110 120 130

O p t im a l D e c is io n s ( X 1 ,X 2 ) : ( 1 6 .0 , 3 2 .0 )
R 1: 2 .0 X 1 - 1 .0 X 2 > = 0 .0
R 2: 1 .0 X 1 + 4 .0 X 2 > = 8 0 .0
R 3: 0 .9 X 1 + 0 .8 X 2 > = 4 0 .0

Z=50.0 X1 + 20.0 X2 =
1440.0
ACTIVA INACTIV HOLGUR EXCEDEN
S AS REDUNDANTES A TES PD
R1: 2 X1 -1 X2 >= 0 X / / / / 8.8
R2: 1.0 X1 + 4.0 X2 >=
80.0 / X / / 64 /
R3: 0.9 X1 + 0.8 X2 >=
40.0 X / / / / 36
a↑∞ ^
b↑4.4/a↓2.25^b↓0
PROBLEMA 7

Z=80.0 X1 + 60.0 X2

R 4: 1 .0 X 1 + 1 .0 X 2 = 2 0 0 .0

P a y o f f : 8 0 .0 X 1 + 6 0 .0 X 2 = 1 3 0 0 0 .0
X 2
120
114
108
102 R 3 : 0 .0 X 1 + 1 .0 X 2 = 8 0 .0
96
90
84
78
72
66
60
54
48
42
36
30
24 R 2 : 1 .0 X 1 + 0 .0 X 2 = 5 0 .0
18
12
6
0 R 1 : 1 .0 X 1 + 1 .0 X 2 = 2 0 0 .0
0 1 02 03 04 05 06 07 08 09 01 0 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 0 0 X1

O p t im a l D e c is io n s ( X 1 ,X 2 ) : ( 5 0 .0 , 1 5 0 .0 )
R 1: 1 .0 X 1 + 1 .0 X 2 > = 2 0 0 .0
R 2: 1 .0 X 1 + 0 .0 X 2 < = 5 0 .0
R 3: 0 .0 X 1 + 1 .0 X 2 > = 8 0 .0
R 4: 1 .0 X 1 + 1 .0 X 2 < = 2 0 0 .0

Z=80.0 X1 + 60.0
X2 = 13000.0
ACTIVA REDUNDAN HOLGUR EXCEDEN
S INACTIVAS TES A TES PD
R1: 1X1 + 1 X2 = 200 X / / / / 60
R2: 1.0 X1 + 0.0 X2 <=
50.0 X / / / / 20
R3: 0.0 X1 + 1.0 X2 >=
80.0 / X / / 70 /
X 2
a↑∞ ^ b↑80
120
/a↓60^b↓∞
114

108

102

96

90

84

PROBLEMA 9
78

Z=
72
2.0 X1 + 1.0 X2

66

60

54

48

42
R 4: 3 .0 X 1 + 1 .0 X 2 = 4 4 .0
36

30
P a y o ff: 2 .0 X 1 + 1 .0 X 2 = 3 1 .0

24

18 R 3: 1 .0 X 1 + 1 .0 X 2 = 1 8 .0

R 1: 0 .0 X 1 + 1 .0 X 2 = 1 0 .0
12

6 R 2: 2 .0 X 1 + 5 .0 X 2 = 7 0 .0

0
0 10 20 30 40 50 60 70 80 90 100 110 120 130

O p t im a l D e c is io n s ( X 1 ,X 2 ) : ( 1 3 .0 , 5 .0 )
R 1: 0 .0 X 1 + 1 .0 X 2 < = 1 0 .0
R 2: 2 .0 X 1 + 5 .0 X 2 < = 7 0 .0
R 3: 1 .0 X 1 + 1 .0 X 2 < = 1 8 .0
R 4: 3 .0 X 1 + 1 .0 X 2 < = 4 4 .0

Z= 2.0 X1 + 1.0 X2 =
31.0
ACTIVA INACTIV REDUNDANTES HOLGUR EXCEDEN PD
S AS A TES
R1: 0.0 X1 + 1.0 X2 <=
10.0 / X / 5 / /
R2: 2.0 X1 + 5.0 X2 <=
70.0 / X / 9 / /
R3: 1.0 X1 + 1.0 X2 <=
18.0 X / / / / 0.5
R4: 3.0 X1 + 1.0 X2 <=
44.0 X / / / / 0.5
a↑3 ^ b↑2
/a↓1^b↓0.7

PROBLEMA 12

Variables
C= # de menus de carne vendidos en un dia
P= # de menusde pescado vendidos en un dia

Funcion Objetivo: Maximizar Utilidades


MAX=16.0 C + 12.0 P

Restricciones

R1: 1.0C + 1.0 P <= 60.0


R2: 0.5C + 0.3 P <= 20.0
R3: 3.0C - 2.0 P <= 0.0
R4: 0.9C - 0.1 P >= 0.0

No Negatividad

C>=0
P>=0

a) Valor optimo 16.0 C + 12.0 P = 800.0


Vértice optimo (20,40)
110

105

100

95

90

85

80

75
70
P a y o f f : 1 6 .0 C + 1 2 .0 P = 8 0 0 .0
65

60

55
50

45

40

35

30

25

20 R 4: 0 .9 C - 0 .1 P = 0 .0
15
R 3: 3 .0 C - 2 .0 P = 0 .0
10
R 2: 0 .5 C + 0 .3 P = 2 0 .0
5

0 R 1: 1 .0 C + 1 .0 P = 6 0 .0
0 9 18 27 36 45 54 63 72 81 90 99 108 117 126

O p t im a l D e c is io n s ( C ,P ) : ( 2 0 .0 , 4 0 .0 )
R 1 : 1 .0 C + 1 .0 P < = 6 0 .0
R 2: 0 .5 C + 0 .3 P < = 2 0 .0
R 3: 3 .0 C - 2 .0 P < = 0 .0
R 4: 0 .9 C - 0 .1 P > = 0 .0

b) Para poder optimizar las ventas el numero de menús de carne debe ser 16 y el numero de
menús de pescado debe ser 12

c) El valor optimo aumenta en 160

d) No afecta la utilidad debido a que la pendiente va hacer la misma.

CHRISTIAM CAVALIE DAVILA

You might also like