Question: The digraph below shows a minimum cost network flow instance. Labels on arcs are (cost, capacity, current flow. Labels on the nodes show net demand.

The digraph below shows a minimum cost network flow instance. Labels on arcs are (cost, capacity, current flow. Labels on the nodes show net demand.

(a) Establish that the given flow is feasible.

(b) Start from the given solution and solve the instance to optimality by the Cycle Cancelling Algorithm 10B. Show the residual digraph at each step, but choose improving feasible cycle directions from them by inspection.

(c) Compute bound 10.26 on the Algorithm 10B computational effort for this instance and compare to the number of steps in your solution of part (b).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Operations Research An Introduction Questions!