Article(electronic)#1June 1959
Maximum number of iterations in the transportation problem
In: Naval research logistics: an international journal, Volume 6, Issue 2, p. 125-129
ISSN: 1520-6750
AbstractIt is shown that there are precisely nm‐1mn−1 bases in a transportation problem having m destinations and n origins. This number gives an upper limit to the number of iterations in solving the problem and is much smaller than that given by the combinatorial formula (mn)!/(m+n−1)1 (mn+1−m−n)1.