Simplex method was developed by George Dantzig in 1947. He was an American mathematician.

The name of the algorithm is derived from the concept of a simplex. "Simplex" represents a geometric figure. Simplex is represented by the minimum number of dimensions of the space such as a line is represented by the two dimensional space and triangle is represented by the two dimensional space (i.e. corners - 1 = dimensions). From these illustrations it can be clear that for two independent variables or factors the shape of the simplex will be triangle. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial cones and these become simplices with an additional constraint.

Simplex method works on linear programs in standard form.

**Effectiveness:**Simplex is one of the most effective methods of optimization.