1. Compare the starting solutions obtained by the northwest-comer, least-cost, and Vogel methods for each of the following models:

*

(a)

(b) (c)

0 2 1 6 1 2 6 7 5 1 8 12 2 1 5 7 0 4 2 12 2 4 0 14 t 2 4 3 7 3 1 5 11 3 6 7 4 5 S 10 10 10 10 9 10 11

(1 d 5.3.2 jd y

is Iterative Computations of the Transportation Algorithm After determining the starting solution (using any of the three methods in Section 5.3.1), we use the following algorithm to determ~ne the optimum solution:

Step 1. Use the simplex optimality condition to determine the entering variable as the current nonbasic variable that can improve the solution. If the optimality condition is satisfied, stop. Otherwise, go to step 2.

Step 2. Determine the leaving variable using the simplex feasibility condition. Change the basis, and return to step 1.