Therefore, to summarize the transportation algorithm:
1) Compute an initial basic feasible solution.
2) Compute the simplex multipliers and the reduced cost coefficients. If all
reduced cost coefficients are nonnegative, stop; the solution is optimal.
Otherwise, go to 3.
3) Select a nonbasic variable corresponding to a negative reduced cost
coefficient to enter the basis. Find the unique 8-100p and update the solution.
Go back to 2.