Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Ahuja, T. Magnanti and J. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, NJ, 1993.

    Google Scholar 

  2. R. Barr, F. Glover and D. Klingman, Enhancements of spanning tree labeling procedures for network optimization, INFOR 17(1979)16–34.

    Google Scholar 

  3. R. Barr and B. Hickman, Parallel simplex for large pure network problems: Computational testing and sources of speedup, Operations Research 42(1994)65–80.

    Google Scholar 

  4. D.P. Bertsekas and P. Tseng, Relaxation methods for minimum cost ordinary and generalized network flow problems, Operations Research 36(1988)93–114.

    Article  Google Scholar 

  5. R. Bland, J. Cheriyan, D. Jensen and L. Ladanyi, An empirical study of min cost flow algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12(1993)110–156.

    Google Scholar 

  6. G. Bradley, G. Brown and G. Graves, Design and implementation of large scale primal transshipment algorithms, Management Science 21(1977)1–38.

    Google Scholar 

  7. G. Brown and R. McBride, Solving generalized networks, Management Science 30(1984)110–156.

    Google Scholar 

  8. N. Curet, A primal–dual simplex method for linear programs, Operations Research Letters 13(1993)233–237.

    Article  Google Scholar 

  9. N. Curet, An incremental primal–dual method for generalized networks, Computers and Operations Research 21(1994)1051–1060.

    Article  Google Scholar 

  10. J. Forrest and D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Mathematical Programming 57(1992)341–374.

    Article  Google Scholar 

  11. F. Glover, D. Karney and D. Klingman, Implementation and computational comparisons of primal, dual and primal–dual computer codes for minimum cost network flow problems, Networks 4 (1974)191–212.

    Google Scholar 

  12. A. Goldberg and M. Kharitonov, On implementing scaling push-relabel algorithms for the minimum-cost flow problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12 (1993)157–198.

    Google Scholar 

  13. D. Goldfarb, Steepest-edge simplex algorithms for network flow problems, Technical Report RC 6649, T.J. Watson Research Laboratory, IBM, 1977.

  14. D. Goldfarb and M. Grigoriadis, An efficient steepest edge algorithm for the maximal flow problem, 10th International Symposium on Mathematical Programming, Montreal, 1979.

  15. M. Grigoriadis, An efficient implementation of the network simplex method, Mathematical Programming Study 26(1986)83–111.

    Google Scholar 

  16. J. Kennington and R. Helgason, Algorithms for Network Programming, Wiley, New York, 1980.

    Google Scholar 

  17. D. Klingman and J. Mote, Computational analysis of large-scale pure networks, ORSA /TIMS Joint National Meeting, New Orleans, 1987.

  18. D. Klingman, A. Napier and J. Stutz, NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost network flow problems, Management Science 20 (1974)814–821.

    Google Scholar 

  19. I. Maros, Performance evaluation of the MINET minimum cost netflow solver, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12(1993)199–218.

    Google Scholar 

  20. J. Mulvey, Pivot strategies for primal-simplex network codes, Journal of the ACM 25(1979)266 –270.

    Article  Google Scholar 

  21. M. Resende and G. Veiga, An efficient implementation of a network interior point method, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12(1993)299–348.

    Google Scholar 

  22. M. Schneider, A complementary pivoting algorithm for linear network problems, Annals of Operations Research 5(1986)439–462.

    Article  Google Scholar 

Download references

Authors
  1. Norman D. Curet
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Curet, N.D. Implementation of a steepest-edge primal - dualsimplex method for network linear programs. Annals of Operations Research 81, 251–270 (1998). https://doi.org/10.1023/A:1018905123635

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018905123635

Keywords

Search

Navigation