2012Unpublished venueRequires access

Linear Programming: Simplex Method

Dennis D. Cox, Michael Cox

Open publisher page 1 citations

Abstract

Since the two-variable approach cannot be easily extended to address problems with more than two variables, a company needs to adopt the simplex method to solve problems with in excess of two variables. This approach can cope with any number of variables and any number of constraining equations. To start to analyses the problem the company first need to change it into a standard form of notation that facilitates the problem being solved. One possible solution is then initially identified from a review of this information and is used for the first phase of the analysis. This initial solution then improves upon through executing a sequence of operations which aim at providing a better estimate of the optimal solution. This sequence may be repeated using ever-improving estimates until either the result has converged to the optimal solution or a solution has been found that is acceptable to the company.

About this research paper

What this paper is about

Since the two-variable approach cannot be easily extended to address problems with more than two variables, a company needs to adopt the simplex method to solve problems with in excess of two variables. This approach can cope with any number of variables and any number of constraining equations. To start to analyses the problem the company first need to change it into a standard form of notation that facilitates the problem being solved. One possible solution is then initially identified from a review of this information and is used for the first phase of the analysis. This initial solution then improves upon through executing a sequence of operations which aim at providing a better estimate of the optimal solution. This sequence may be repeated using ever-improving estimates until either the result has converged to the optimal solution or a solution has been found that is acceptable to the company.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Since the two-variable approach cannot be easily extended to address problems with more than two variables, a company needs to adopt the simplex method to solve problems with in excess of two variables. This approach can cope with any number of variables and any number of constraining equations. To start to analyses the problem the company first need to change it into a standard form of notation that facilitates the problem being solved. One possible solution is then initially identified from a review of this information and is used for the first phase of the analysis. This initial solution then improves upon through executing a sequence of operations which aim at providing a better estimate of the optimal solution. This sequence may be repeated using ever-improving estimates until either the result has converged to the optimal solution or a solution has been found that is acceptable to the company.

Key concepts: Sequence (biology), Simplex algorithm, Linear programming, Simplex, Mathematical optimization, Notation, Variable (mathematics), Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Linear Programming: Simplex Method — Research Paper | ScholarLens