Pivot versus interior point methods: pros and cons

Illes, T. and Terlaky, T. (2002) Pivot versus interior point methods: pros and cons. European Journal of Operational Research, 140 (2). pp. 170-190. ISSN 0377-2217 (http://dx.doi.org/10.1016/S0377-2217(02)00061-9)

Full text not available in this repository.Request a copy

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.

ORCID iDs

Illes, T. ORCID logoORCID: https://orcid.org/0000-0002-5396-3148 and Terlaky, T.;
CORE (COnnecting REpositories)