For any transportation algorithm, in last allocation supply and demand are must satisfied simultaneously where one row or column is crossed out and another is remains with zero supply or demand.
By the rules of transportation algorithm,
when exactly one row or column has zero supply or
demand then iteration is complete and this zero must
not allocate in any cell