Pivot versus interior point methods: Pros and cons

  title={Pivot versus interior point methods: Pros and cons},
  author={Tibor Ill{\'e}s and Tam{\'a}s Terlaky},
  journal={European Journal of Operational Research},
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
11 Citations
51 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 51 references

The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP

  • K. Fukuda, H.-J. Lüthi, M. Namiki
  • International Transactions on Operations Research…
  • 1997
Highly Influential
4 Excerpts

How good is the simplex algorithm

  • V. Klee, G. J. Minty
  • In O. Shisha,
  • 1972
Highly Influential
7 Excerpts

Linear Programming and Extensions

  • G. B. Dantzig
  • 1963
Highly Influential
11 Excerpts

The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm

  • E. D. Andersen, K. D. Andersen
  • High Performance Optimization,
  • 1999
Highly Influential
4 Excerpts

Implementation of interior point methods for large scale linear programming

  • E. D. Andersen, J. Gondzio, Cs. Mészáros, X. Xu
  • In T. Terlaky, editor, Interior Point Methods of…
  • 1996
Highly Influential
6 Excerpts

A convergent criss-cross method

  • T. Terlaky
  • Mathematics of Operationsforschung und Statistics…
  • 1985
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…