Simplex

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

A simplex is the solution space to an optimization problem with linear restraints. The most common method used in practice for finding optimal solution(s) on a simplex is the simplex method.