Two False Endings to the Modified Assignment Problem: A Solution

Rick Hesse
Additional contact information
Rick Hesse: Visiting Professor of Management Science, United States Military Academy, West Point, New York 10996

Interfaces, 1982, vol. 12, issue 4, 69-71

Abstract: Dr. Bharath brings to light a point raised also in personal correspondence by Dieter Klein, Worcester Polytechnic Institute in the fall of 1980 about Stern's modification of the assignment algorithm to solve the transportation problem which resurfaces in Hesse/Woolsey. The condition described is indeed necessary but not sufficient and is analogous to a regular assignment problem having zeros in every row and column but still without a zero-cost allocation. In the modified method, when this happens, lines must be drawn again such that the total of the supplies and demands lined out are strictly less than the total supply (or demand).

Keywords: transportation; mathematics; matrices (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/inte.12.4.69 (application/pdf)

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:inm:orinte:v:12:y:1982:i:4:p:69-71

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().