Simplex algorithm: Difference between revisions

Revision as of 09:47, 11 March 2014

Revision as of 18:26, 11 March 2014

Line 10:

== Overview ==

{{further2|[[Linear programming]]}}

[[Image:Simplex -description-en.pngsvg|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.]]