The Transhipment Problem

Alex Orden
Additional contact information
Alex Orden: Burroughs Corporation

Management Science, 1956, vol. 2, issue 3, 276-285

Abstract: The transportation problem has offered two mathematical facets: (1) as a specialized type of linear programming problem, (2) as a method of representation of some combinatorial problems. In this paper a third aspect of the mathematical properties of the transportation problem is developed. It is shown that the same mathematical framework can be extended beyond pair-wise connections, to the determination of optimum linked paths over a series of points. This extension although viewed here as a linear programming problem, takes advantage of the combinatorial aspect of the transportation problem, and applications may arise which, like the assignment problem, appear to be combinatorial problems, but which can be solved by linear programming.

Date: 1956
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.2.3.276 (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:ormnsc:v:2:y:1956:i:3:p:276-285

Access Statistics for this article

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