(Feasible Distribution Theorem) Show that the minimum cost flow problem introduced in Section 1.2.1, has a Show also that feasibility of the problem can be determined by solving a max- flow problem...

(Feasible Distribution Theorem) Show that the minimum cost flow problem introduced in Section 1.2.1, has a

Show also that feasibility of the problem can be determined by solving a max- flow problem with zero lower flow bounds. Hint: Assume first that all lower flow bounds bij are zero. Use the conversion to a max-flow problem of Fig. 3.1, and apply the max-flow/min-cut theorem. In the general case, transform the problem to one with zero lower flow bounds.