Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

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

Full text not available in this repository. (Request a copy from the Strathclyde author)

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.

Item type: Article
ID code: 9200
Keywords: linear programming, linear optimization, pivot methods, simplex algorithms, interior point methods, complexity, sensitivity analysis, Management. Industrial Management, Modelling and Simulation, Management Science and Operations Research, Information Systems and Management
Subjects: Social Sciences > Industries. Land use. Labor > Management. Industrial Management
Department: Strathclyde Business School > Management Science
Related URLs:
    Depositing user: Strathprints Administrator
    Date Deposited: 26 Mar 2010 15:00
    Last modified: 04 Sep 2014 19:13
    URI: http://strathprints.strath.ac.uk/id/eprint/9200

    Actions (login required)

    View Item