The simplex method was introduced by Geogre B. Danzig in 1948 to solve a linear programming problem. For the problem given in the introduction, it involves starting at the origin and then moving along the edges of the polyhedron towards the maximum. It uses linear algebra to follow the edges. Usually it works well, though it can, in very carefully constructed examples, run in exponential time.

Copyright ©2005 by Douglas Wilhelm Harder. All rights reserved.