Transportation Basis There are m+n equations in a transportation problem, but one row is dependent so there are m+n-1 rows in each simplex tableau Theorem: All bases are triangular. with mn-(m+n-1) nonbasic variables set to zero, equations can be reordered triangularly Theorem: If supplies and demands are Integers, every corner point solution Is Integer Integer basic feasible solutions X+r.trntx j j +x+x 41 x;+x21…+x2 j ++ru=a nk +x+x nlTransportation Basis • m+n equations in a transportation problem, but one row is dependent so there are m+n-1 rows in each simplex tableau. • mn-(m+n-1) zero, equations can be reordered triangularly. • integers, every corner point solution is integer. Integer basic feasible solutions mk ml kl n ij ik jk ml kl m jk ij lk jk ml kl x x x b x x x x x a x x x x x x a            ... ... 1  There are Theorem: All bases are triangular. – with nonbasic variables set to Theorem: If supplies and demands are