simplex method
an algebraic procedure for solving linear programming problems in which elementary row operations are used to iterate from one basic feasible solution (extreme point) to another until the optimal solution is reachedThis definition last updated 07/03/2008