Question: Consider the tree solution for the following minimum cost network flow problem:
![1083_A.png](https://secure.tutorsglobe.com/CMSImages/1083_A.png)
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 dual network simplex method, what is the leaving arc?
(b) What is the entering arc?
(c) After one pivot, what is the new tree solution?