Standard technique in linear programming for solving an optimization problem, typically one involving a function and several constraints expressed as inequalities. The inequalities define a polygonal region (see polygon), and the solution is typically at one of the vertices. The simplex method is a systematic procedure for testing the vertices as possible solutions.
This entry comes from Encyclopædia Britannica Concise.
For the full entry on simplex method, visit Britannica.com.
Seen & Heard
What made you look up simplex method? Please tell us what you were reading, watching or discussing that led you here.