For the following network 10 (1, 10) (2, 15) i 20 (0, 10) 0 (1,5) (CU)...

  

Transcribed Image Text:

For the following network 10 (1, 10) (2, 15) i 20 (0, 10) 0 (1,5) (CU) (6, 10) (4, 10) (5, 10) 0 (2, 20) (7,15) 7 -15 (8, 10) 8-10 (9, 15) a) Find a maximal feasible solution. b) Using the cycle-canceling algorithm, solve the minimum cost flow problem. At each iteration, clearly indicate the total change in your objective function. Activate Windows Go to Settings to activate Windows. For the following network 10 (1, 10) (2, 15) i 20 (0, 10) 0 (1,5) (CU) (6, 10) (4, 10) (5, 10) 0 (2, 20) (7,15) 7 -15 (8, 10) 8-10 (9, 15) a) Find a maximal feasible solution. b) Using the cycle-canceling algorithm, solve the minimum cost flow problem. At each iteration, clearly indicate the total change in your objective function. Activate Windows Go to Settings to activate Windows.