Consider the Metro Water District transportation problem presented in Table 8.12.

(a) Formulate the network representation of this problem as a minimum cost flow problem. (Hint: Arcs where flow is prohibited should be deleted.)

D,I

(b) Starting with the initial BF solution given in Table 8.19, use the network simplex method yourself (without an automatic computer routine) to solve this problem. Compare the sequence of BF solutions obtained with the sequence obtained by the transportation simplex method in Table 8.23.