MATH 332 - Linear Programming and Operations Research

2020-2021 Catalog Year

Credit(s): 3
Lecture: 3
Non-Lecture: 0
The course introduces the student to the techniques for the formulation and solution of linear programming problems and their corresponding dual problems. It is intended to be a broad overview of deterministic linear programming and operations research. Topics to be covered include the Simplex Method, the Dual Simplex Method, Sensitivity Analysis, Network Optimization Methods, (Deterministic) Dynamic Programming, Game Theory and Branch and Bound Methods for Integer Programming. Additional Topics may be selected from the Cutting Plane Methods for Integer Programming, the Transportation Problem, the Assignment Problem, Graphs and Networks, the Network Simplex Method, the Ellipsoid Algorithm, and the Critical Path Method when time permits.

Prerequisite(s): MATH 222, MATH 233, one of MATH 237 or MATH 239, and MATH 230 or permission of instructor.
Offered: Spring, even years