Professional Documents
Culture Documents
Network - Maximal Flow
Network - Maximal Flow
2003 Thomson/South-Western
Slide 1
2003 Thomson/South-Western
Slide 2
2
4
Source
2
4
2
4
Sink
5
3
2003 Thomson/South-Western
5
6
Slide 3
Example
A transshipment model can be developed
for the maximal flow problem.
We will add an arc from node 7 back to
node 1 to represent the total flow
through the network.
There is no capacity on the newly added
7-1 arc.
We want to maximize the flow over the
7-1 arc.
2003 Thomson/South-Western
Slide 4
Example
Modified Network Model
3
2
4
Source
2
4
2
4
Sink
5
3
2003 Thomson/South-Western
5
6
Slide 5
2003 Thomson/South-Western
Slide 6
Slide 7
xij - xji = 0
(conservation of flow)
i
j
(cij is capacity of ij arc)
(non-negativity)
2003 Thomson/South-Western
Slide 8
LP Formulation
18 variables (for 17 original arcs and 1
added arc)
24 constraints
7 node flow-conservation constraints
2003 Thomson/South-Western
Slide 9
2003 Thomson/South-Western
Slide 10
LP Formulation (continued)
Arc Capacity Constraints
x12 < 4 x13 < 3 x14 < 4
x24 < 2
x25 < 3
x34 < 3
x42 < 3
x36 < 6
x43 < 5
x45 < 3
x52 < 5
x54 < 5
x57 < 5
x64 < 5
x67 < 5
2003 Thomson/South-Western
x46 < 1
x47 < 3
Slide 11
Optimal Solution
2
2
3
Source
1
4
5
Sink
1
3
1
3
10
2003 Thomson/South-Western
Slide 12
Food of thought
Mathematics is made of 50 percent
formulas, 50 percent proofs, and 50
percent imagination.
2003 Thomson/South-Western
Slide 13