Revised simplex method: Difference between revisions

Revision as of 09:50, 11 March 2014

Revision as of 18:40, 11 March 2014

Line 1:

In [[mathematical optimization]], the '''revised simplex method''' is an variant of [[George Dantzig]]'s [[simplex method]] for [[linear programming]].

The revised simplex method is mathematically equivalent to the standard simplex method but differs in implementation. Instead of maintaining a tableau which explicitly represents the constraints adjusted to a set of basic variables, it maintains a representation of a [[Basis (linear algebra)|basis]] of the [[Matrix (mathematics)|matrix]] representing the constraints. The matrix-oriented approach allows for greater computational efficiency by enabling sparse matrix operations.{{sfn|Morgan|1997|loc=§2}}

==Problem formulation==