Simplex Method

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
An iterative algorithm for solving linear programming problems by moving along edges of the feasible polytope between basic feasible solutions until an optimal extreme point is reached.