Simplex Algorithm

Dantzig's simplex algorithm, or simplex method, is an algorithm for solving linear programming problems: optimizing a linear objective function subject to linear equality and inequality constraints. George Dantzig developed it in the mid-1940s while working on planning methods for the United States Army Air Force, refining the formulation by incorporating an objective function in 1947. The algorithm's name comes from the geometric concept of a simplex, a term suggested by T. S. Motzkin, even though simplices are not literally used within the method itself. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/