Difference between revisions of "Simplex method"
Jump to navigation
Jump to search
m |
m (cat) |
||
| Line 1: | Line 1: | ||
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]]. | 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]]. | ||
| − | [[Category: | + | [[Category:Linear algebra]] |
Revision as of 21:31, June 8, 2008
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.