Simplex algorithm: Difference between revisions

Revision as of 16:03, 23 September 2013

Revision as of 02:54, 2 October 2013

Line 13:

[[Image:Simplex description.png|thumb|240px|A [[system of linear inequalities]] defines a [[polytope]] as a feasible region. The simplex algorithm begins at a starting [[vertex (geometry)|vertex]] and moves along the edges of the polytope until it reaches the vertex

of the optimum solution.]]

[[Image:Simplex-method-3-dimensions.png|thumb|240px|Polyhedron of simplex algorithm in 3D]]

The simplex algorithm operates on linear programs in ''standard form'', that is linear programming problems of the form,