The transportation simplex computes row and column potentials, enters a negative-reduced-cost cell, and pivots around its induced alternating cycle.
The northwest-corner method repeatedly allocates the smaller remaining supply and demand in the current top-left cell to construct an initial transportation basis.
For transportation potentials, the reduced cost is ; a negative value identifies a candidate entering cell. A positive feasible cycle step then decreases the objective; a degenerate zero step changes the basis without a strict decrease.
Adding a nonbasic edge to a transportation tree creates one cycle; alternating equal additions and subtractions around it preserves every row and column sum.

Articles by others on the same topic (0)

There are currently no matching articles.