Row Minima Methods:
Steps1: The smallest cost in the first row of the transportation table is determined. Let it be C_{1j} . allocate as much as possible amount X_{1j} = min (a_{1} ,b_{1}) so that either the capacity of origin O_{1} is exhausted or the requirement at destination D j is satisfied or both .
Steps2:
a. If X_{1} = a_{1} so that the availability at origin O_{1} is completely exhausted cross out the first row of the table and move down to the second row.
b. If X_{1} = a_{1} b_{1} the origin capacity a1 is completely exhausted as well as the requirement at destination D_{j }is completely satisfied. An arbitrary tie breaking choice is made. Cross out the j column and make the second allocation X_{1k} = 0 in the cell ( 1k ) with C1k being the new minimum cost in the first row. Cross out the first row and move down to the second row.
c. If X_{1}j= b_{j }so that the requirement at destination Dj is satisfied cross out the j column and reconsider the first row with the remaining availability of origin O_{1}.
Step 3: Repeat steps I and 2 for the reduced transportation table until all the requirements are satisfied.