Solving Singly Constrained Transshipment Problems

F. Glover, D. Karney, D. Klingman and R. Russell
Additional contact information
F. Glover: University of Colorado, Boulder, Colorado
D. Karney: The Williams Companies, Tulsa, Oklahoma
D. Klingman: The University of Texas at Austin, Austin, Texas
R. Russell: University of Tulsa, Tulsa, Oklahoma

Transportation Science, 1978, vol. 12, issue 4, 277-297

Abstract: This paper develops a primal simplex procedure to solve transshipment problems with an arbitrary additional constraint. The procedure incorporates efficient methods for pricing-out the basis, determining certain key vector representations, and implementing the change of basis. These methods exploit the near triangularity of the basis in a manner that takes advantage of computational schemes and list structures used to solve the pure transshipment problem. We have implemented these results in a computer code, I / O PNETS-I . Computational results (necessarily limited) confirm that this code is significantly faster than APEX-III on some large problems. We have also developed a fast method for determining near optimal integer solutions. Computational results show that the near optimum integer solution value is usually within 0.5% of the value of the optimum continuous solution value.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.4.277 (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:ortrsc:v:12:y:1978:i:4:p:277-297

Access Statistics for this article

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