Simplex Method

LPP has target to optimize its objective,
Its requirements are some linear relationship.

Linear relationship are in unbalanced condition,
Slacked and surplus variables balanced the equation.

System of linear inequality defines a polytope,
Moving along its edge  is our hope.

Algorithm is to move from start vertex to optimum one,
Process is finished when isn't possible to improve the solution

Simplex method is for solving problems in Linear programming,

Its inventor name is George Dantzing.

Dantzing solved two open problems in statistical theory
Motivated from Prof. Neyman's inquiry.