Question: Consider the tree solution for the following minimum cost network flow problem:
The numbers on the tree arcs represent primal flows while numbers on the nontree arcs are dual slacks.
(a) Using the largest-coefficient rule in the primal network simplex method, what is the entering arc?
(b) What is the leaving arc?
(c) After one pivot, what is the new tree solution?