The Simplex Method
Phase I : locate a corner of the feasible set.
- corner = intersection of n different planes (in n dimensions)
Phase II: move from corner to corner along the edges of the feasible set -- always go along an edge that is guaranteed to decrease the cost.
- Edge = intersection of n-1 different planes
When reach a local minimum (maximum), you’ve found the optimum.