Maximum number of iterations in the transportation problem

Michel A. Simonnard and G. F. Hadley

Naval Research Logistics Quarterly, 1959, vol. 6, issue 2, 125-129

Abstract: It 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.

Date: 1959
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800060204

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:6:y:1959:i:2:p:125-129

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().