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)

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: https://orcid.org/0000-0002-5396-3148

• Share and Export
  

  RefWorksRIS (EndNote Online, Zotero, Ref manager, etc)RDF+XMLEndNoteASCII CitationOpenURL ContextObject in SpanMPEG-21 DIDLRIOXX2 XMLBibTeXAtomEP3 XMLDublin CoreRDF+N-TriplesMODSHTML CitationJSONData Cite XMLRDF+N3Multiline CSVOpenURL ContextObjectReferSimple MetadataMETS
• Item metadata

  Item type:	Article
  ID code:	9200
  Dates:	Date Event 16 July 2002 Published
  Subjects:	Social Sciences > Industries. Land use. Labor > Management. Industrial Management
  Department:	Strathclyde Business School > Management Science
  Depositing user:	Strathprints Administrator
  Date deposited:	26 Mar 2010 15:00
  Last modified:	29 Nov 2024 09:23
  URI:	https://strathprints.strath.ac.uk/id/eprint/9200