The Simplex Method

In 1947, George Dantzig [51] developed an efficient method, the simplex algorithm, for solving linear programming problems. Since the development of the simplex method, LP has been used to solve optimization problems any where where there appears a necessity of optimizing some absolute criteria. It might be, for example, cost of trucking, profit gained by some company, number of full-time employees, cost of nutrition rations, etc.