Summary of the Transportation Algorithm. The steps of the transportation algorithm are exact parallels of the simplex algorithm.
Step 1. Determine a starting basic feasible solution, and go to step 2.
Step 2. Use the optimality condition of the simplex method to determine the entering variable
from among all the nonbasic variables. If the optimality condition is satisfied, stop. Otherwise, go to step 3.
Step 3. Use the feasibility condition of the simplex method to determine the leaving
variable from among all the current basic variables, and find the new basic solution. Return to step 2.