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.