The Transportation Model in Operations Research follows a structured algorithmic sequence:

1. Make a Transportation Table
   First, construct the transportation tableau by listing sources (supply), destinations (demand), and transportation costs. Balance the problem if total supply ≠ total demand.

2. Find the basic feasible solution
   Obtain an initial feasible solution using methods such as Northwest Corner Rule, Least Cost Method, or Vogel’s Approximation Method.

3. Perform Optimality Test
   Apply optimality testing techniques such as the MODI (u–v) method or Stepping Stone method to check whether the current solution is optimal.

4. Iterate towards an optimal solution
   If the solution is not optimal, improve it by reallocating shipments along closed loops.

5. Test for Optimality
   After iteration, re-test to confirm that all opportunity costs are non-negative (for minimization). If satisfied, the solution is optimal.

Thus, the correct procedural sequence is:

Transportation Table → Initial Basic Feasible Solution → Optimality Test → Improvement → Final Optimality Confirmation