Skip to main content
SpringerLink
Log in

Computational study of the GDPO dual phase-1 algorithm

  • Original Paper
  • Published:
Computational Management Science Aims and scope Submit manuscript

Abstract

The GDPO algorithm for phase-1 of the dual simplex method developed by Maros possesses some interesting theoretical features that have potentially huge computational advantages. This paper gives account of a computational analysis of GDPO that has investigated how these features work in practice by exploring the internal operation of the algorithm. Experience of a systematic study involving 48 problems gives an insight how the predicted performance advantages materialize that ultimately make GDPO an indispensable tool for dual phase-1.

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

  • Benders JF (2005) Partitioning procedures for solving mixed-variables programming problems. Comput Manage Sci 2(1): 3–19

    Article  Google Scholar 

  • Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton

    Google Scholar 

  • Forrest JJH, Goldfarb D (1992) Steepest edge simplex algorithms for linear programming. Math Program 57(3): 341–374

    Article  Google Scholar 

  • Fourer R (1994) Notes on the dual simplex method. Draft, Department of Industrial Engineering and Management Sciences, Northwestern University, March 1994. Optimization online, August 2000. http://www.optimization-online.org/DB_HTML/2000/08/214.html

  • Hall JAJ (2008) Towards a practical parallelisation of the simplex method. Comput Manage Sci. doi:10.1007/s10287-008-0080-5

  • Harris PMJ (1973) Pivot selection method of the Devex LP code. Math Program 5: 1–28

    Article  Google Scholar 

  • Koberstein A, Suhl U (2007) Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms. Comput Optim Appl 37(1): 49–65

    Article  Google Scholar 

  • Lemke CE (1954) The dual method of solving the linear programming problem. Naval Res Logist Q 1: 36–47

    Article  Google Scholar 

  • Maros I (1998) A Piecewise linear dual procedure in mixed integer programming. In: Giannesi F, Komlósi S, Rapcsák T (eds) New trends in mathematical programming. Kluwer, Dordrecht, pp 159–170

    Google Scholar 

  • Maros I (2003a) A piecewise linear dual phase-1 algorithm for the simplex method. Comput Optim Appl 26: 63–81

    Article  Google Scholar 

  • Maros I (2003b) Computational techniques of the simplex method. In: International series in operations research and management. Kluwer, Boston, vol 61. ISBN 1–4020–7332–1. 325+xx p (research monograph)

  • Maros I, Mitra G (1996) Simplex algorithms. In: Beasley J (eds) Advances in linear and integer programming. Oxford University Press, New York, pp 1–46

    Google Scholar 

  • Maros I, Mitra G (1998) Strategies for creating advanced bases for large-scale linear programming problems. Informs J Comput 10(2): 248–260

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pannonia, Veszprem, Hungary

    István Maros

  2. Imperial College, London, UK

    István Maros

Authors
  1. István Maros
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to István Maros.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maros, I. Computational study of the GDPO dual phase-1 algorithm. Comput Manag Sci 7, 207–223 (2010). https://doi.org/10.1007/s10287-009-0094-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10287-009-0094-7

Keywords

Search

Navigation