An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks

John Hultz, Darwin Klingman and Robert Russell
Additional contact information
John Hultz: University of Texas, Austin, Texas
Darwin Klingman: University of Texas, Austin, Texas
Robert Russell: University of Tulsa, Tulsa, Oklahoma

Operations Research, 1976, vol. 24, issue 2, 301-313

Abstract: This paper presents a “one-pass” algorithm that determines an “advanced” dual basic feasible solution for a class of capacitated generalized network problems. Special cases in this class of problems include transportation and transshipment problems. We include computational results that show that this new start substantially improves the solution performance of the dual method for transportation and transshipment problems. In fact, a dual code employing this advanced start is found to be faster (in terms of total solution time) than the fastest out-of-kilter code SUPERK on highly rectangular transportation problems.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.2.301 (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:oropre:v:24:y:1976:i:2:p:301-313

Access Statistics for this article

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