Credits: 3 credits
Delivery: Campus
Algorithms for linear programming are introduced and studied in this course, from both theoretical and applied perspectives. Topics include the graphic method; simplex method; revised simplex method; and duality theory. Special linear programming such as network flows and game theory are also explored.
Prerequisites:MATH 2120 or MATH 2121
For more information, search for this course here.