# Presentation Topic 3 - Networks

By:
Fernando Brandao - 00146919

For:
IEGR – 461: Operations Research, Deterministic Models
Dr. M. Salimian
Fall 2013

Department of Industrial and Systems Engineering
Morgan State University
Wednesday, September 25, 2013

1. n} with the max flow of 55. For each cut provide information on nodes that are in S.Considering the network bellow respond: 1) Create a table and identify all possible cuts. Distinguish the minimal cut. 4. 2) Find the maximum flow through the network from source to sink node using the labeling routine and maximum flow algorithm and compare your result with the minimum cut capacity. 5. Cut N. nodes that are in S-bar. . 1 2 3 4 5 6 7 8 S S S-1 S-2 S-1-2 S-1-2-3 S-1-2-3-4 S-1-2-3-5 S-1-2-3-4-5 S-bar 1-2-3-4-5-n 2-3-4-5-n 1-3-4-5-n 3-4-5-n 4-5-n 5-n 4-n n Max-Flow 80 60 75 55 70 70 60 60 Where the minimal cut is S = {S. and cut capacity. 2} and S-bar = {3.

5 => 3 is a backward arc (because is a forward arc from 3 to 5. Where: S => 2 is a forward arc (with 40 of capacity and 30 of flow. and a capacity of increase of 5). and a capacity of increase of 10). we can augment the max flow of the network in 5 units that will give us the network below: . and a capacity of increase of 10). 2 => 5 is a forward arc (with 20 of capacity and 15 of flow. and a capacity of decrease of 5). So. 3 => n is a forward arc (with 10 of capacity and 0 of flow. a capacity of 10 and a flow of 5.Patch S-1-4-n S-1-3-4-n S-2-3-4-n S-2-3-5-n S-2-5-n Max Patch Flow 10 10 10 5 15 Total Flow 10 20 30 35 50 Let’s considerate the following patch: S => 2 => 5 => 3 => n. analyzing the arc above.

The LP associated with this network is: MAX F Subject to: F – XS1 – XS2 = 0. . X25 + X35 – X5N =0 X4N + X3N + X5N – F =0. X14 =< 10. XS1 – X14 – X13 = 0.There is the optimum max flow (55). X14 + X34 – X4N = 0. XS2 – X23 – X25 = 0. X13 + X23 – X34 – X3N – X35 = 0. XS2 =< 40. solve using LINDO and compare results. XS1 =< 40. 3) Write the LP associated with this network.

X23 .XS1 .X13 =< 10. X34 =< 20. X23 =< 15. The result matches with the one find in 1) and 2).X35 = 0 Flow 55 20 35 10 10 15 20 15 10 0 25 20 .X25 = 0 5) X13 + X23 . X3N =< 10. X4N =< 30.X3N .X13 = 0 4) XS2 . LINDO Output: MAX F SUBJECT TO 2) F . Solving by LINDO we have this optimal solution: Patch F XS1 XS2 X14 X13 X23 X25 X34 X3N X35 X4N X5N Where Xij is the patch between i and j.XS2 = 0 3) XS1 .X14 . X5N =< 20. X25 =< 20. X35 =< 10.X34 .

000000 .00000 VARIABLE F VALUE 55.X5N = 0 8) .000000 0.000000 REDUCED COST 0.000000 XS2 35.000000 X14 10.000000 0.000000 XS1 20.000000 0.X4N = 0 7) X25 + X35 .F + X3N + X4N + X5N = 0 9) XS1 <= 40 10) XS2 <= 40 11) X14 <= 10 12) X13 <= 10 13) X23 <= 15 14) X25 <= 20 15) X34 <= 20 16) X3N <= 10 17) X35 <= 10 18) X4N <= 30 19) X5N <= 20 END ------------------------------------------------- LP OPTIMUM FOUND AT STEP 0 OBJECTIVE FUNCTION VALUE 1) 55.6) X14 + X34 .

000000 1.000000 0.000000 19) 0.000000 X34 15.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0.000000 1.X13 10.000000 0.000000 17) 10.000000 0.000000 11) 0.000000 0.000000 0.000000 X25 20.000000 X4N 25.000000 16) 0.000000 X3N 10.000000 6) 0.000000 10) 5.000000 18) 5.000000 0.000000 0.000000 0.000000 X5N 20.000000 5) 0.000000 X23 15.000000 14) 0.000000 -1.000000 -1.000000 1.000000 0.000000 15) 5.000000 0.000000 13) 0.000000 3) 0.000000 0.000000 9) 20.000000 12) 0.000000 7) 0.000000 4) 0.000000 .000000 X35 0.000000 0.000000 0.000000 1.000000 0.000000 0.000000 -1.000000 0.000000 0.000000 1.000000 8) 0.000000 0.

000000 XS1 0.000000 INFINITY 1.000000 X34 0.000000 20. ITERATIONS= 0 RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT COEF F ALLOWABLE INCREASE 1.000000 .000000 20.000000 35.000000 X25 0.000000 INFINITY 1.000000 INFINITY 1.NO.000000 INFINITY 1.000000 INFINITY 1.000000 INFINITY 1.000000 1.000000 X2S 0.000000 0.000000 1.000000 X5N 0.000000 XS2 0.000000 X3N 0.000000 ALLOWABLE DECREASE INFINITY 1.000000 X13 0.000000 INFINITY 0.000000 X14 0.000000 INFINITY 3 0.000000 4 0.000000 0.000000 1.000000 INFINITY 1.000000 INFINITY X4N 0.000000 35.000000 5.000000 RIGHTHAND SIDE RANGES ROW CURRENT RHS ALLOWABLE INCREASE ALLOWABLE DECREASE 2 0.000000 INFINITY 1.000000 X23 0.000000 X35 0.

000000 17 10.000000 INFINITY 5.000000 5.000000 5.000000 15.com/watch?v=J0wzih3_5Wo .000000 5.000000 35.000000 INFINITY 5.000000 10.5 0.000000 0.youtube.000000 INFINITY 5.000000 INFINITY 20.000000 5.000000 14 20.000000 0.000000 15.000000 10 40.000000 19 20.000000 10.000000 13 15.000000 6 0.000000 INFINITY 10.000000 15 20.000000 15.000000 25.000000 16 10.000000 11 10.000000 5.000000 References [1] https://www.000000 20.000000 12 10.000000 18 30.000000 5.000000 INFINITY 9 40.000000 7 0.000000 20.000000 INFINITY 0.000000 8 0.