Pivot versus interior point methods: pros and cons

T. Illes, T. Terlaky

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

Linear optimization (LO) is the fundamental problem of mathematical optimization. It admits an enormous number of applications in economics, engineering, science and many other fields. The three most significant classes of algorithms for solving LO problems are: pivot, ellipsoid and interior point methods. Because ellipsoid methods are not efficient in practice we will concentrate on the computationally successful simplex and primal-dual interior point methods only, and summarize the pros and cons of these algorithm classes.
Original languageEnglish
Pages (from-to)170-190
Number of pages20
JournalEuropean Journal of Operational Research
Volume140
Issue number2
DOIs
Publication statusPublished - 16 Jul 2002

    Fingerprint

Keywords

  • linear programming
  • linear optimization
  • pivot methods
  • simplex algorithms
  • interior point methods
  • complexity
  • sensitivity analysis

Cite this