Algorithms for linear programming are introduced and studied for both theoretical and applied perspectives. Topics include the graphic method, simplex method, revised simplex method, and duality theory, as well as some special linear programming such as network flows and game theory.
Prerequisite: MATH 212