Simplex algorithm

Algorithm for linear programming

In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial cones, and these become proper simplices with an additional constraint.

From Wikipedia, under CC BY-SA. More on occurri.