Simplex method

From Conservapedia
This is the current revision of Simplex method as edited by DavidB4-bot (talk | contribs) at 14:35, July 28, 2016. This URL is a permanent link to this version of this page.
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.