Question: Consider the following tree solution for a minimum cost network flow problem:

(a) For what values of μ is this tree solution optimal?
(b) What are the entering and leaving arcs?
(c) After one pivot, what is the new tree solution?
(d) For what values of μ is the new tree solution optimal?