1. Linear Programming Reading: CLRS, Ch. 29 or reference
CSE 6331 Algorithms
Steve Lai

10. Source: Linear programming, Thomas S. Ferguson, UCLA

28. Source: Linear programming, Thomas S. Ferguson, UCLA
Simplex Method
A system of linear inequalities defines a polytope (or simplex) as a feasible region.
The simplex algorithm begins at a starting vertex and moves along the edges of the polytope until it reaches the vertex of the optimum solution.
Source: Linear programming, Thomas S. Ferguson, UCLA

52. References
T.S. Ferguson, “Linear Programming: A Concise Introduction,” .
Lecture notes: