Implementation of a steepest-edge primal - dualsimplex method for network linear programs

Norman Curet

Annals of Operations Research, 1998, vol. 81, issue 0, 270 pages

Abstract: A primal - dual simplex variant is presented that incrementally builds up the optimal LPbasis matrix. For network LPs, the incremental primal - dual algorithm can adopt steepest-edgedirections of movement utilizing standard graph data structures without additionalcomputational overhead. Computational results indicate the resulting implementation isuniformly superior to other direction movement schemes, and achieves order of magnitudespeedups versus a primal network simplex code on medium size NETGEN problems. Thesespeedups carry over to the generalized network problem domain as well. Some comparisonsare also made against the relaxation method on NETGEN uncapacitated transportation andtransshipment problems. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018905123635 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:81:y:1998:i:0:p:251-270:10.1023/a:1018905123635

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018905123635

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().