Simplex method

This is an old revision of this page, as edited by Foxtrot (talk | contribs) at 20:27, January 14, 2008. It may differ significantly from current revision.
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The simplex method is used in optimization theory to solve optimization problems with linear restraints. It is based on the knowledge that the solution space will be a simplex.