Problema 1

Red original
4
2 4

2 2
2

1 1 3 6

4
3 2
3 5

Diseño de la red
[0,4]
2 4

[0,2] [0,2]
[0,2]
F0 = 0 -F0 = 0
1 [0,1] [0,3] 6

[0,4]
[0,3] [0,2]
3 5

Iteración 1
Trayectoria G* = 1-2-4-6
min {G*} = min {arco (1, 2), arco (2, 4), arco (4, 6)} = min {2, 4, 2} = 2
F1 = F0 + min {G*} = 0 + 2 = 2
[0,4]
2 4

[0,2] [0,2]
[0,2]
F1 = 2 -F1 = 2
1 [0,1] [0,3] 6

[0,4]
[0,3] [0,2]
3 5

Calcular la red residual

[2,2]
2 4

[2,0] [2,0]
[0,2]
F1 = 2 -F1 = 2
1 [0,1] [0,3] 6

[0,4]
[0,3] [0,2]
3 5

Iteración 2
Trayectoria G* = 1-3-5-6
min {G*} = min {arco (1, 3), arco (3, 5), arco (5, 6)} = min {4, 3, 2} = 2
F2 = F1 + min {G*} = 2 + 2 = 4

1
 [2,2]
2 4

[2,0] [2,0]
[0,2]
F2 = 4 -F2 = 4
1 [0,1] [0,3] 6

[0,4]
[0,3] [0,2]
3 5

Calcular la red residual

[2,2]
2 4

[2,0] [2,0]
[0,2]
F2 = 4 -F2 = 4
1 [0,1] [0,3] 6

[2,2]
[2,1] [2,0]
3 5

Iteración 3
No existe un Trayectoria con capacidad cR(i*, j*) ≥ 0

Solución óptima

2
2 4

2 2

1 6

2
2 2
3 5

El flujo máximo es 4.

Problema 2
Red original
s1 10

r1 3
12
s2 5 t1
15

8
r2
6
s3 14 t2
20
r3
7 13

s4 11 t3
18

2
r4

s5

2
Diseño de la red

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[0,15]
[0,ꚙ]
[0,ꚙ] 8
[0,8] [0,6]
F0 = 0 [0,ꚙ] [0,ꚙ] -F0 = 0
1 4 [0,14] 12 14
[0,20]
[0,ꚙ] 9
[0,7] [0,13] [0,ꚙ]

[0,ꚙ] 5 [0,11] [0,18] 13

[0,2] 10

Iteración 1
Trayectoria G* = 1-4-9-12-14
min {G*} = min {arco (1, 4), arco (4, 9), arco (9, 12), arco (12, 14)} = min {ꚙ, 14, 20, ꚙ} = 14
F1 = F0 + min {G*} = 0 + 14 = 14

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[0,15]
[0,ꚙ]
[0,ꚙ] 8
[0,8] [0,6]
F1 = 14 [0,ꚙ] [0,ꚙ] -F1 = 14
1 4 [0,14] 12 14
[0,20]
[0,ꚙ] 9
[0,7] [0,13] [0,ꚙ]

[0,ꚙ] 5 [0,11] [0,18] 13

[0,2] 10

3
Calcular la red residual

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[0,15]
[0,ꚙ]
[0,ꚙ] 8
[0,8] [0,6]
F1 = 14 [14,ꚙ] [14,ꚙ] -F1 = 14
1 4 [14,0] 12 14
[14,6]
[0,ꚙ] 9
[0,7] [0,13] [0,ꚙ]

[0,ꚙ] 5 [0,11] [0,18] 13

[0,2] 10

Iteración 2
Trayectoria G* = 1-5-10-13-14
min {G*} = min {arco (1, 5), arco (5, 10), arco (10, 13), arco (13, 14)} = min {ꚙ, 11, 18, ꚙ} = 11
F2 = F1 + min {G*} = 14 + 11 = 25

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[0,15]
[0,ꚙ]
[0,ꚙ] 8
[0,8] [0,6]
F2 = 25 [14,ꚙ] [14,ꚙ] -F2 = 25
1 4 [14,0] 12 14
[14,6]
[0,ꚙ] 9
[0,7] [0,13] [0,ꚙ]

[0,ꚙ] 5 [0,11] [0,18] 13

[0,2] 10

4
Calcular la red residual

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[0,15]
[0,ꚙ]
[0,ꚙ] 8
[0,8] [0,6]
F2 = 25 [14,ꚙ] [14,ꚙ] -F2 = 25
1 4 [14,0] 12 14
[14,6]
[11,ꚙ] 9
[0,7] [0,13] [11,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

Iteración 3
Trayectoria G* = 1-4-8-11-14
min {G*} = min {arco (1, 4), arco (4, 8), arco (8, 11), arco (11, 14)} = min {ꚙ, 8, 15, ꚙ} = 8
F3 = F2 + min {G*} = 25 + 8 = 33

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[0,15]
[0,ꚙ]
[0,ꚙ] 8
[0,8] [0,6]
F3 = 33 [14,ꚙ] [14,ꚙ] -F3 = 33
1 4 [14,0] 12 14
[14,6]
[11,ꚙ] 9
[0,7] [0,13] [11,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

5
Calcular la red residual

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[8,7]
[8,ꚙ]
[0,ꚙ] 8
[8,0] [0,6]
F3 = 33 [22,ꚙ] [14,ꚙ] -F3 = 33
1 4 [14,0] 12 14
[14,6]
[11,ꚙ] 9
[0,7] [0,13] [11,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

Iteración 4
Trayectoria G* = 1-5-9-13-14
min {G*} = min {arco (1, 5), arco (5, 9), arco (9, 13), arco (13, 14)} = min {ꚙ, 7, 13, ꚙ} = 7
F4 = F3 + min {G*} = 33 + 7 = 40

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[8,7]
[8,ꚙ]
[0,ꚙ] 8
[8,0] [0,6]
F4 = 40 [22,ꚙ] [14,ꚙ] -F4 = 40
1 4 [14,0] 12 14
[14,6]
[11,ꚙ] 9
[0,7] [0,13] [11,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

6
Calcular la red residual

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[8,7]
[8,ꚙ]
[0,ꚙ] 8
[8,0] [0,6]
F4 = 40 [22,ꚙ] [14,ꚙ] -F4 = 40
1 4 [14,0] 12 14
[14,6]
[18,ꚙ] 9
[7,0] [7,6] [18,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

Iteración 5
Trayectoria G* = 1-3-8-11-14
min {G*} = min {arco (1, 3), arco (3, 8), arco (8, 11), arco (11, 14)} = min {ꚙ, 5, 7, ꚙ} = 5
F5 = F4 + min {G*} = 40 + 5 = 45

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [0,5] 11
[8,7]
[8,ꚙ]
[0,ꚙ] 8
[8,0] [0,6]
F5 = 45 [22,ꚙ] [14,ꚙ] -F5 = 45
1 4 [14,0] 12 14
[14,6]
[18,ꚙ] 9
[7,0] [7,6] [18,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

7
Calcular la red residual

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [5,0] 11
[13,2]
[13,ꚙ]
[5,ꚙ] 8
[8,0] [0,6]
F5 = 45 [22,ꚙ] [14,ꚙ] -F5 = 45
1 4 [14,0] 12 14
[14,6]
[18,ꚙ] 9
[7,0] [7,6] [18,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

Iteración 6
Trayectoria G* = 1-2-7-11-14
min {G*} = min {arco (1, 2), arco (2, 7), arco (7, 11), arco (11, 14)} = min {ꚙ, 10, 3, ꚙ} = 3
F6 = F5 + min {G*} = 45 + 3 = 48

2 [0,10]

[0,12]
7 [0,3]
[0,ꚙ]
3 [5,0] 11
[13,2]
[13,ꚙ]
[5,ꚙ] 8
[8,0] [0,6]
F6 = 48 [22,ꚙ] [14,ꚙ] -F6 = 48
1 4 [14,0] 12 14
[14,6]
[18,ꚙ] 9
[7,0] [7,6] [18,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

8
Calcular la red residual

2 [3,7]

[0,12]
7 [3,0]
[3,ꚙ]
3 [5,0] 11
[13,2]
[16,ꚙ]
[5,ꚙ] 8
[8,0] [0,6]
F6 = 48 [22,ꚙ] [14,ꚙ] -F6 = 48
1 4 [14,0] 12 14
[14,6]
[18,ꚙ] 9
[7,0] [7,6] [18,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

Iteración 7
Trayectoria G* = 1-6-10-13-14
min {G*} = min {arco (1, 6), arco (6, 10), arco (10, 13), arco (13, 14)} = min {ꚙ, 2, 7, ꚙ} = 2
F7 = F6 + min {G*} = 48 + 2 = 50

2 [3,7]

[0,12]
7 [3,0]
[3,ꚙ]
3 [5,0] 11
[13,2]
[16,ꚙ]
[5,ꚙ] 8
[8,0] [0,6]
F7 = 50 [22,ꚙ] [14,ꚙ] -F7 = 50
1 4 [14,0] 12 14
[14,6]
[18,ꚙ] 9
[7,0] [7,6] [18,ꚙ]

[0,ꚙ] 5 [11,0] [11,7] 13

[0,2] 10

9
Calcular la red residual

2 [3,7]

[0,12]
7 [3,0]
[3,ꚙ]
3 [5,0] 11
[13,2]
[16,ꚙ]
[5,ꚙ] 8
[8,0] [0,6]
F7 = 50 [22,ꚙ] [14,ꚙ] -F7 = 50
1 4 [14,0] 12 14
[14,6]
[18,ꚙ] 9
[7,0] [7,6] [20,ꚙ]

[2,ꚙ] 5 [11,0] [13,5] 13

[2,0] 10

Iteración 8
No existe un Trayectoria con capacidad cR(i*, j*) ≥ 0

Solución óptima

2 3

7 3

3 5 11
13

8
8

4 14 12
14
9
7 7

5 11 13
13

2
10

Interpretación de la solución

10
 s1 3

r1 3

s2 5 t1
13

8
r2

s3 14 t2
14
r3
7 7

s4 11 t3
13

2
r4

s5

De s1 se envían 3 unidades a t1.

De s2 se envían 5 unidades a t1.
De s3 se envían 8 unidades a t1.
De s3 se envían 14 unidades a t2.
De s4 se envían 7 unidades a t3.
De s4 se envían 11 unidades a t3.
De s5 se envían 2 unidades a t3.

Problema 3
Red original

5 A 7

B E J
4 7
5
5 H
15 10

F 7 K
10 15

5 30
C I

7 4 L
15
D G
10

a) Determinar el valor de flujo máximo que pase por la red actual.

11
Diseño de la red

[0,15]
5 [0,7]
F0 = 0
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [0,15]
[0,5] 10
[0,15] [0,15] [0,10]
[0,20] -F0 = 0
[0,15] 7 11 14
[0,15] [0,7]
[0,10]
[0,15]
3 [0,5] 9 [0,30]

[0,7] [0,4] 13
4 8 [0,15]
[0,10]

Iteración 1
Trayectoria G* = 1-4-8-9-11-14
min {G*} = min {arco (1, 4), arco (4, 8), arco (8, 9), arco (9, 11), arco (11, 14)} = min {15, 10, 15, 30, 20} = 10
F1 = F0 + min {G*} = 0 + 10 = 10
Calcular la red residual

[0,15]
5 [0,7]
F1 = 10
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [0,15]
[0,5] 10
[0,15] [0,15] [0,10]
[10,10] -F1 = 10
[10,5] 7 11 14
[0,15] [0,7]
[0,10]
[0,15]
3 [0,5] 9 [10,20]

[0,7] [0,4] 13
4 8 [10,5]
[10,0]

Iteración 2
Trayectoria G* = 1-3-7-9-11-14
min {G*} = min {arco (1, 3), arco (3, 7), arco (7, 9), arco (9, 11), arco (11, 14)} = min {15, 10, 15, 20, 10} = 10
F2 = F1 + min {G*} = 10 + 10 = 20
Calcular la red residual

[0,15]
5 [0,7]
F2 = 20
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [0,15]
[0,5] 10
[10,5] [0,15] [0,10]
[20,0] -F2 = 20
[10,5] 7 11 14
[10,5] [0,7]
[10,0]
[0,15]
3 [0,5] 9 [20,10]

[0,7] [0,4] 13
4 8 [10,5]
[10,0]

Iteración 3
Trayectoria G* = 1-3-8-9-11-12-14
min {G*} = min {arco (1, 3), arco (3, 8), arco (8, 9), arco (9, 11), arco (11, 12), arco (12, 14)} = min {5, 7, 5, 10,
10, 15} = 5
F3 = F2 + min {G*} = 20 + 5 = 25

12
Calcular la red residual

[0,15]
5 [0,7]
F3 = 25
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [5,10]
[0,5] 10
[15,0] [0,15] [5,5]
[20,0] -F3 = 25
[10,5] 7 11 14
[10,5] [0,7]
[10,0]
[0,15]
3 [0,5] 9 [25,5]

[5,2] [0,4] 13
4 8 [15,0]
[10,0]

Iteración 4
Trayectoria G* = 1-2-7-9-11-12-14
min {G*} = min {arco (1, 2), arco (2, 7), arco (7, 9), arco (9, 11), arco (11, 12), arco (12, 14)} = min {10, 5, 5, 5,
5, 10} = 5
F4 = F3 + min {G*} = 25 + 5 = 30
Calcular la red residual

[0,15]
5 [0,7]
F4 = 30
1 2 [0,5] 6 [0,4] [0,7] 12
[5,5]
[5,0] [10,5]
[0,5] 10
[15,0] [0,15] [10,0]
[20,0] -F4 = 30
[10,5] 7 11 14
[15,0] [0,7]
[10,0]
[0,15]
3 [0,5] 9 [30,0]

[5,2] [0,4] 13
4 8 [15,0]
[10,0]

Iteración 5
Trayectoria G* = 1-2-5-6-9-10-12-14
min {G*} = min {arco (1, 2), arco (2, 5), arco (5, 6), arco (6, 9), arco (9, 10), arco (10, 12), arco (12, 14)} = min
{5, 5, 7, 15, 7, 7, 5} = 5
F5 = F4 + min {G*} = 30 + 5 = 35
Calcular la red residual

[0,15]
5 [5,2]
F5 = 35
1 2 [5,0] 6 [0,4] [5,2] 12
[10,0]
[5,0] [15,0]
[0,5] 10
[15,0] [5,10] [10,0]
[20,0] -F5 = 35
[10,5] 7 11 14
[15,0] [5,2]
[10,0]
[0,15]
3 [0,5] 9 [30,0]

[5,2] [0,4] 13
4 8 [15,0]
[10,0]

Iteración 6
Trayectoria G* = 1-5-6-9-13-14
min {G*} = min {arco (1, 5), arco (5, 6), arco (6, 9), arco (9, 13), arco (13, 14)} = min {15, 2, 10, 4, 15} = 2
F6 = F5 + min {G*} = 35 + 2 = 37

13
Calcular la red residual

[2,13]
5 [7,0]
F6 = 37
1 2 [5,0] 6 [0,4] [5,2] 12
[10,0]
[5,0] [15,0]
[0,5] 10
[15,0] [7,8] [10,0]
[20,0] -F6 = 37
[10,5] 7 11 14
[15,0] [5,2]
[10,0]
[2,13]
3 [0,5] 9 [30,0]

[5,2] [2,2] 13
4 8 [15,0]
[10,0]

Iteración 7
No existe un Trayectoria con capacidad cR(i*, j*) ≥ 0

Solución
El flujo máximo es 37 millones de m3.

2
A 7

1 B 5 E 5 J
10
5 15
H
15 7 10
20
10 F K 14
15 5
10
2
C I 30

5 2 L
D G 15
10

b) El valor de flujo se piensa que es insuficiente, además el consejo comunal decide arreglar las
canalizaciones (A, E) y (I, L). Determinar las capacidades a prever para esas dos canalizaciones y el valor
del nuevo flujo máximo.

La canalización (A, E) = (5, 6) debe aumentar a 20 m3. La canalización (I, L) = (9, 13) debe aumentar a 15 m3.

Diseño de la red

[0,15]
5 [0,20]
F0 = 0
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [0,15]
[0,5] 10
[0,15] [0,15] [0,10]
[0,20] -F0 = 0
[0,15] 7 11 14
[0,15] [0,7]
[0,10]
[0,15]
3 [0,5] 9 [0,30]

[0,7] [0,15] 13
4 8 [0,15]
[0,10]

Iteración 1
Trayectoria G* = 1-5-6-9-13-14
14
min {G*} = min {arco (1, 5), arco (5, 6), arco (6, 9), arco (9, 13), arco (13, 14)} = min {15, 20, 15, 15, 15} = 15
F1 = F0 + min {G*} = 0 + 15 = 15
Calcular la red residual

[15,0]
5 [15,5]
F1 = 15
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [0,15]
[0,5] 10
[0,15] [15,0] [0,10]
[0,20] -F1 = 15
[0,15] 7 11 14
[0,15] [0,7]
[0,10]
[15,0]
3 [0,5] 9 [0,30]

[0,7] [15,0] 13
4 8 [0,15]
[0,10]

Iteración 2
Trayectoria G* = 1-4-8-9-11-14
min {G*} = min {arco (1, 4), arco (4, 8), arco (8, 9), arco (9, 11), arco (11, 14)} = min {15, 10, 15, 30, 20} = 10
F2 = F1 + min {G*} = 15 + 10 = 25
Calcular la red residual

[15,0]
5 [15,5]
F2 = 25
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [0,15]
[0,5] 10
[0,15] [15,0] [0,10]
[10,10] -F2 = 25
[10,5] 7 11 14
[0,15] [0,7]
[0,10]
[15,0]
3 [0,5] 9 [10,20]

[0,7] [15,0] 13
4 8 [10,5]
[10,0]

Iteración 3
Trayectoria G* = 1-3-7-9-11-14
min {G*} = min {arco (1, 3), arco (3, 7), arco (7, 9), arco (9, 11), arco (11, 14)} = min {15, 10, 15, 20, 10} = 10
F4 = F3 + min {G*} = 25 + 10 = 35
Calcular la red residual

[15,0]
5 [15,5]
F3 = 35
1 2 [0,5] 6 [0,4] [0,7] 12
[0,10]
[0,5] [0,15]
[0,5] 10
[10,5] [15,0] [0,10]
[20,0] -F3 = 35
[10,5] 7 11 14
[10,5] [0,7]
[10,0]
[15,0]
3 [0,5] 9 [20,10]

[0,7] [15,0] 13
4 8 [10,5]
[10,0]

Iteración 4
Trayectoria G* = 1-2-7-9-11-12-14
15
min {G*} = min {arco (1, 2), arco (2, 7), arco (7, 9), arco (9, 11), arco (11, 12), arco (12, 14)} = min {10, 5, 5, 10,
10, 15} = 5
F4 = F3 + min {G*} = 35 + 5 = 40
Calcular la red residual

[15,0]
5 [15,5]
F4 = 40
1 2 [0,5] 6 [0,4] [0,7] 12
[5,5]
[5,0] [5,10]
[0,5] 10
[10,5] [15,0] [5,5]
[20,0] -F4 = 40
[10,5] 7 11 14
[15,0] [0,7]
[10,0]
[15,0]
3 [0,5] 9 [25,5]

[0,7] [15,0] 13
4 8 [10,5]
[10,0]

Iteración 5
Trayectoria G* = 1-3-8-9-11-12-14
min {G*} = min {arco (1, 3), arco (3, 8), arco (8, 9), arco (9, 11), arco (11, 12), arco (12, 14)} = min {5, 7, 5, 5, 5,
10} = 5
F5 = F4 + min {G*} = 40 + 5 = 45
Calcular la red residual

[15,0]
5 [15,5]
F5 = 45
1 2 [0,5] 6 [0,4] [0,7] 12
[5,5]
[5,0] [10,5]
[0,5] 10
[15,0] [15,0] [10,0]
[20,0] -F5 = 45
[10,5] 7 11 14
[15,0] [0,7]
[10,0]
[15,0]
3 [0,5] 9 [30,0]

[5,2] [15,0] 13
4 8 [15,0]
[10,0]

Iteración 6
Trayectoria G* = 1-2-5-6-10-12-14
min {G*} = min {arco (1, 2), arco (2, 5), arco (5, 6), arco (6, 10), arco (10, 12), arco (12, 14)} = min {5, 5, 5, 4, 7,
5} = 4
F6 = F5 + min {G*} = 45 + 4 = 49
Calcular la red residual

[15,0]
5 [19,1]
F6 = 49
1 2 [4,1] 6 [4,0] [4,3] 12
[9,1]
[5,0] [14,1]
[0,5] 10
[15,0] [15,0] [10,0]
[20,0] -F6 = 49
[10,5] 7 11 14
[15,0] [0,7]
[10,0]
[15,0]
3 [0,5] 9 [30,0]

[5,2] [15,0] 13
4 8 [15,0]
[10,0]

16
Iteración 7
No existe un Trayectoria con capacidad cR(i*, j*) ≥ 0

Solución
El flujo máximo es 49 millones de m3.

15
A 19

1 B 4 E 4 4 J
9
5 14
H
15 15 10
20
10 F K 14
15
10
15
C I 30

5 15 L
D G 15
10

c) Dada la importancia de los trabajos, el consejo comunal decide no arreglar las dos canalizaciones al
mismo tiempo. ¿En qué orden se deben hacer las reparaciones para aumentar, después de concluir cada
trabajo, el valor del flujo máximo que pasa por la red?

Si primero hacemos la canalización (A, E) = (5, 6), tendremos la siguiente red modificada.

[2,13]
5 [7,13]
F6 = 37
1 2 [5,0] 6 [0,4] [5,2] 12
[10,0]
[5,0] [15,0]
[0,5] 10
[15,0] [7,8] [10,0]
[20,0] -F6 = 37
[10,5] 7 11 14
[15,0] [5,2]
[10,0]
[2,13]
3 [0,5] 9 [30,0]

[5,2] [2,2] 13
4 8 [15,0]
[10,0]

Iteración 7a
Trayectoria G* = 1-5-6-9-13-14
min {G*} = min {arco (1, 5), arco (5, 6), arco (6, 9), arco (9, 13), arco (13, 14)} = min {13, 13, 8, 2, 13} = 2
F7 = F6 + min {G*} = 37 + 2 = 39
Calcular la red residual

[4,11]
5 [9,11]
F7 = 39
1 2 [5,0] 6 [0,4] [5,2] 12
[10,0]
[5,0] [15,0]
[0,5] 10
[15,0] [9,6] [10,0]
[20,0] -F7 = 39
[10,5] 7 11 14
[15,0] [5,2]
[10,0]
[4,11]
3 [0,5] 9 [30,0]

[5,2] [4,0] 13
4 8 [15,0]
[10,0]

17
Iteración 8a
No existe un Trayectoria con capacidad cR(i*, j*) ≥ 0

Si primero hacemos la canalización (I, L) = (9, 13), tendremos la siguiente red modificada.

[2,13]
5 [7,0]
F6 = 37
1 2 [5,0] 6 [0,4] [5,2] 12
[10,0]
[5,0] [15,0]
[0,5] 10
[15,0] [7,8] [10,0]
[20,0] -F6 = 37
[10,5] 7 11 14
[15,0] [5,2]
[10,0]
[2,13]
3 [0,5] 9 [30,0]

[5,2] [2,17] 13
4 8 [15,0]
[10,0]

Iteración 7b
No existe un Trayectoria con capacidad cR(i*, j*) ≥ 0

Entonces, primero haríamos la canalización (A, E) = (5, 6), y luego la canalización (I, L) = (9, 13).

Con la primera canalización, el flujo máximo aumenta de 37 a 39 millones de m3. Luego, con la segunda
canalización, el flujo máximo aumenta de 39 a 49 millones de m3.

Problema 4
a) Grafique una red adecuada para esta situación.

M1
5

P1
5 8

8 5
8
M2
5
10 5

O P2 T
5
5
M3 8
9 5
8
5
P3

M4

b) Formule un modelo de programación lineal que permita determinar que si con las condiciones planteadas
es posible culminar los proyectos a tiempo.
18
 b5 = 0

5
5
b2 = 0
2
5 8
b6 = 0
8 5
8
6

Fuente 5 Sumidero
10 5

1 3 9
5 b7 = 0
b1 = 100 b3 = 0 b9 = -100
5
7 8
9 5
8
5
4

b4 = 0

8
ꚙ b8 = 0

Variables de decisión
Xij: cantidad de trabajadores asignados entre los nodos i y j
Donde i = 1, 2, 3, 4, 5, 6, 7, 8; j = 2, 3, 4, 5, 6, 7, 8, 9
Función objetivo
Maximizar el número de trabajadores asignados a los proyectos
Min Z = 100000 X19
Restricciones
Flujo en el nodo 1
X12 + X13 + X14 + X19 = 100
Flujo en el nodo 2
X25 + X26 + X27 - X12 = 0
Flujo en el nodo 3
X35 + X36 + X37 + X38 - X13 = 0
Flujo en el nodo 4
X45 + X46 - X14 = 0
Flujo en el nodo 5
X59 - X25 - X35 - X45 = 0
Flujo en el nodo 6
X69 - X26 - X36 - X46 = 0
Flujo en el nodo 7
X79 - X27 - X37 = 0
Flujo en el nodo 8
X89 - X38 = 0
Flujo en el nodo 9
- X19 – X59 – X69 – X79 = -100
Capacidad mínima en el arco (1, 2)
X12 ≥ 8
Capacidad mínima en el arco (1, 3)
X13 ≥ 10
Capacidad mínima en el arco (1, 4)
X14 ≥ 9
Capacidad máxima en el arco (2, 5)
X25 ≤ 5
Capacidad máxima en el arco (2, 6)
19
X26 ≤ 5
Capacidad máxima en el arco (2, 7)
X27 ≤ 5
Capacidad máxima en el arco (3, 5)
X35 ≤ 5
Capacidad máxima en el arco (3, 6)
X36 ≤ 5
Capacidad máxima en el arco (3, 7)
X37 ≤ 5
Capacidad máxima en el arco (3, 8)
X38 ≤ 5
Capacidad máxima en el arco (4, 5)
X45 ≤ 5
Capacidad máxima en el arco (4, 6)
X46 ≤ 5
Capacidad máxima en el arco (5, 9)
X59 ≤ 8
Capacidad máxima en el arco (6, 9)
X69 ≤ 8
Capacidad máxima en el arco (7, 9)
X79 ≤ 8
Capacidad máxima en el arco (8, 9)
X89 ≤ 8
Rango de existencia
Xij ≥ 0

Este modelo de PL no tiene solución.

Consideremos que cada mes se dispone de 9 trabajadores.

Reporte por computadora

MIN 100000 X19
SUBJECT TO
2) X19 + X12 + X13 + X14 = 100
3) - X12 + X25 + X26 + X27 = 0
4) - X13 + X35 + X36 + X37 + X38 = 0
5) - X14 + X45 + X46 = 0
6) - X25 - X35 - X45 + X59 = 0
7) - X26 - X36 - X46 + X69 = 0
8) - X27 - X37 + X79 = 0
9) - X38 + X89 = 0
10) - X19 - X59 - X69 - X79 = - 100
11) X12 >= 8
12) X13 >= 10
13) X14 >= 9
14) X25 <= 5
15) X26 <= 5
16) X27 <= 5
17) X35 <= 5
18) X36 <= 5
19) X37 <= 5
20) X38 <= 5
21) X45 <= 5
22) X46 <= 5
23) X59 <= 9
24) X69 <= 9
25) X79 <= 9
26) X89 <= 9
END
OBJECTIVE FUNCTION VALUE
20
 1) 7300000.

VARIABLE VALUE REDUCED COST

X19 73.000000 0.000000
X12 8.000000 0.000000
X13 10.000000 0.000000
X14 9.000000 0.000000
X25 0.000000 0.000000
X26 3.000000 0.000000
X27 5.000000 0.000000
X35 5.000000 0.000000
X36 1.000000 0.000000
X37 4.000000 0.000000
X38 0.000000 0.000000
X45 4.000000 0.000000
X46 5.000000 0.000000
X59 9.000000 0.000000
X69 9.000000 0.000000
X79 9.000000 0.000000
X89 0.000000 0.000000

Solución
M1

3
P1
9

8 5
9
M2
5

10 1
O P2 T
4

4 M3 9
9

5
P3

Cantidad
mínima de
Mes 1 Mes 2 Mes 3 Mes 4
trabajadores
requeridos
Proyecto 1 0 3 5 X 8
Proyecto 2 5 1 4 0 10
Proyecto 3 4 5 X X 9
Disponibilidad de
9 9 9 9
Trabajadores

21