1

2 3 4

TRAMOS: 1,2,3,4
ESTADOS: ---->Sn DISPONIBILIDAD
VARIABLES------> Xn DECISION
FUNCION: DESCRIBE EL PROCESO EN CADA ETAPA
 a b c d e f
XAB XBD XCD XDH XEF XFG
XAC XBE XCH XDG XEK XFJ
XAD XCI XDF XFK

Función objetivo Min Z= 20XAB + 30XAC + 60XAD + 30XBD + 60XBE + 20XCD + 80XCH + 90
+30GH + 30XGJ + 60XGM + 80XGL + 40XHI + 3
Desde Hacia Distancia Ruta
A B 20 0
TRAMO A C 30 1
A D 60 0
TRAMO B D 30 0
B E 60 0
C D 20 0
TRAMO C H 80 0
C I 90 1
D H 60 0
TRAMO D G 60 0
D F 40 0
TRAMO E F 30 0
E K 50 0
F G 30 0
TRAMO F J 20 0
F K 40 0
G H 30 0
TRAMO G J 30 0
G M 60 0
G L 80 0
TRAMO H I 40 0
H M 30 0
TRAMO I O 30 1
I M 80 0
TRAMO J L 70 0
TRAMO K L 60 0
TRAMO L M 40 0
TRAMO M O 60 0

Distancia minima 150

30 90 30 150 km
A C I O
 g h i j k l m
XGH XHI XIO XJL XKL XLM XMO
XGJ XHM XIM
XGM
XGL

+ 60XBE + 20XCD + 80XCH + 90XCI + 60XDH +60XDG +40XDF + 30XEF +50XEK + 30XFG + 20XFJ + 40XFK
J + 60XGM + 80XGL + 40XHI + 30XHM + 30XIO + 80XIM + 70XJL + 60XKL + 40XLM + 60XMO

Nodo Flujo Condición

A 1
B 0
C 0
D 0
E 0
F 0
G 0
H 0
I 0
J 0
K 0
L 0
M 0
O -1
= 1
= 0
= 0
= 0
= 0
= 0
= 0
= 0
= 0
= 0
= 0
= 0
= 0
= -1
wn = 1
fn(Sn) = Max { rn(Sn,dn) + f*n-1 (Sn-1)}
dn <= Sn
Sn-1 = Sn - dn

d4 = X4 d3 = X3 d2 = X2

S4 = 6 S3 = 6 S2 S1
4 3 2

r4 r3 r2

PARTE B

Etapa 1 [n=1] IOP2

d1 = X1
Rangos
S1 d1 S1
Mínimo 0 0
1
Etapa 1
Máximo 4 4

r1
Etapa 2 [n=2] PCP
d2 = X2
Rangos
S2 d2 S2
Mínimo 0 0
2
Etapa 2
Máximo 5 3

r2

Etapa 3 [n=3] OPU

d3= X3
Rangos
S2 d2 S3
Mínimo 0 0
3
Etapa 3
Máximo 5 4

r3
Etapa 4 [n=4] OPU
d4= X4
Rangos
S2 d2 S4
Mínimo 0 0
4
Etapa 3
Máximo 5 4

r4
 d1 = X1

S0 = 0
1 f0(S0) = 0

r1

PARTE B

f1(S1) = Max { r1(S1,d1)} SAOCO

d1 <= S1
S0 = 0 S 0 = S 1 - d1
f0(S0) = 0 S0 = 0 ------> d1 = S1

S1 d1 f*1 X1
 0 0 0 0
1 5 5 1
2 11 11 2
3 15 15 3
4 23 23 4

f2(S2) = Max { r2(S2,d2) + f*1 (S1)} ALOHA

d2 <= S2
S1 S 1 = S 2 - d2

d2
S2
0 1 2 3
0 -5 --- --- ---
1 0 4 --- ---
2 6 9 12 ---
3 10 15 17 17
4 18 19 23 22
5 27 27 28

f3(S3) = Max { r3(S3,d3) + f*2 (S2)} CARIBE

d3 <= S3
S2 S2 = S3 - d3

d3
S3
0 1 2 3 4
 0 -20 --- --- --- ---
1 -11 -8 --- --- ---
2 -3 1 0 --- ---
3 2 9 9 9 ---
4 8 14 17 18 17
5 13 20 22 26 26

f4(S4) = Max { r4(S4,d4) + f*3 (S3)} TIBURON

d4 <= S4
S3 S3 = S4- d4

d3
S3
0 1 2 3 4
0 -20 --- --- --- ---
1 -8 -14 --- --- ---
2 1 -2 -10 --- ---
3 9 7 2 -4 ---
4 18 15 11 8 1
5 26 24 19 17 13
LA SOLUCION ES:

RESTAURANTPEDIDOS RESTAURANTPEDIDOS
SAOCO 0 SAOCO 0
ALOHA 2 ALOHA 3
CARIBE 3 CARIBE 2
TIBURON 0 TIBURON 0
5 5
d2
f*2 X2

-5 0
4 1
12 2
17 2,3
23 2
28 3

f*3 X3
-20 0
-8 1
1 1
9 1,2,3
18 3
26 3,4

f*3 X3

-20 0
-8 0
1 1
9 0
18 0
26 0
ETAPA 4: MES 4 D=1 f4(S4,X4,D4) = min {6(X4 + S4 - D4) + 35 + 15X4}
S4 X4 = 0 X4 = 1 X4 = 2 f*4 x*4
0 50 71 50 1
1 35 56 77 35 0
2 41 62 41 0

ETAPA 3: MES 3 D=2 f3(S3,X3,D3) = min {6(X3 + S4 - D4) + 35 + 15X3} + f4( X3

S3 X3 = 0 X3 = 1 X3 = 2 f*3 x*3
0 115 115 2
1 100 106 100 1
2 85 91 118 85 0

ETAPA 2: MES 2 D=1 f2(S2,X2,D2) = min {6(X4 + S4 - D4) + 35 + 15X4} + f3( X2

S2 X2= 0 X2= 1 X2= 2 f*2 x*2
0 165 171 165 1
1 150 156 162 150 0
2 141 147 141 0

ETAPA 1: MES 1 D=2 f1(S1,X1,D1) = min {6(X4 + S4 - D4) + 35 + 15X4} + f2( X1 + S1 - D1)}
S2 X2= 0 X2= 1 X2= 2 f*1 x*2
0 230 230 2

SOLUCIÓN COSTO MÍNIMO DEL ´PROGRAMA ES $200

MES 1 2 3 4
PRODUCC 2 1 2 1
DEMANDA 2 1 2 1
INV-INIC 0 0 0 0
INV. FINAL 0 0 0 0
D4) + 35 + 15X4}

D4) + 35 + 15X3} + f4( X3 + S3 - D3)}

f4(2+0-2) = f4(0)
X3 2
S3 0
D3 2

D4) + 35 + 15X4} + f3( X2 + S2 - D2)}

X4} + f2( X1 + S1 - D1)}