Exercise 7.9

and construct a nevw problem in which all cost edand at some sink nodes. (In order to maintain feasibility, we hat the value of the optimal cost will also increase? Prove or provide a 7.9 Consider the uncapacitated network flow problem shown in Fig What is the matrix A corresponding to this problem? Solve the problem using the network simplex algorithm. Start with the to D indicated by the dashed arcs in the figure. and construct a nevw problem in which all cost edand at some sink nodes. (In order to maintain feasibility, we hat the value of the optimal cost will also increase? Prove or provide a 7.9 Consider the uncapacitated network flow problem shown in Fig What is the matrix A corresponding to this problem? Solve the problem using the network simplex algorithm. Start with the to D indicated by the dashed arcs in the figure