ScholarLens Back to search
2011•Wiley Encyclopedia of Operations Research and Management ScienceRequires access

Simplex‐Based LP Solvers

István Maros

Open publisher page 0 citations

Abstract

Abstract The simplex method is widely used to solve linear programming problems in diverse application areas. It is used as a stand‐alone solver and also as the computational engine of the solution of other optimization problems. The emerging problems tend to be large to very large. Practical solution of such problems requires sophisticated implementation of the simplex method. This article gives an account of the most important developments that have enabled the simplex method to become a reliable, efficient, and flexible solver.

About this research paper

What this paper is about

Abstract The simplex method is widely used to solve linear programming problems in diverse application areas. It is used as a stand‐alone solver and also as the computational engine of the solution of other optimization problems. The emerging problems tend to be large to very large. Practical solution of such problems requires sophisticated implementation of the simplex method. This article gives an account of the most important developments that have enabled the simplex method to become a reliable, efficient, and flexible solver.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract The simplex method is widely used to solve linear programming problems in diverse application areas. It is used as a stand‐alone solver and also as the computational engine of the solution of other optimization problems. The emerging problems tend to be large to very large. Practical solution of such problems requires sophisticated implementation of the simplex method. This article gives an account of the most important developments that have enabled the simplex method to become a reliable, efficient, and flexible solver.

Key concepts: Solver, Simplex, Simplex algorithm, Linear programming, Computer science, Mathematical optimization, Revised simplex method, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Simplex‐Based LP Solvers — Research Paper | ScholarLens