Question: Consider the following tree solution for a minimum cost network flow problem:
As usual, bold arcs represent arcs on the spanning tree, numbers next to the bold arcs are primal flows, numbers next to non-bold arcs are dual slacks, and numbers next to nodes are dual variables.
(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?