Solving multicommodity transportation problems using a primal partitioning simplex technique

Jeff L. Kennington

Naval Research Logistics Quarterly, 1977, vol. 24, issue 2, 309-325

Abstract: This paper presents the details for applying and specializing the work of Saigal [28] and Hartman and Lasdon [16] to develop a primal partitioning code for the multicommodity transportation problem. The emphasis of the paper is in presenting efficient data structure techniques for exploiting the underlying network structure of this class of problems. Computational experience with test problems whose corresponding linear programming formulation has over 400 rows and 2,000 columns is presented.

Date: 1977
References: Add references at CitEc
Citations:

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

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:24:y:1977:i:2:p:309-325

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 ().