Course Catalog - 2023-2024

     

CMOR 441 - LINEAR AND INTEGER PROGRAMMING

Long Title: LINEAR AND INTEGER PROGRAMMING
Department: Comp Appl Math Operations Rsch
Grade Mode: Standard Letter
Language of Instruction: Taught in English
Course Type: Lecture
Credit Hours: 3
Restrictions:
Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
Prerequisite(s): MATH 302 AND (CAAM 335 OR CMOR 302)
Description: This course provides a rigorous introduction to linear optimization with continuous and integral variables. We explore the theory and algorithms of linear and integer programming. Topics studied in the linear programming part include polyhedral theory, duality, and algorithms for solving linear programs. Building on linear programming, the second part of this course studies linear optimization with integral variables. Here, the topics covered are integral polyhedra and perfect formulations, including TU matrices and TDI systems. We culminate with exact methodologies for integer programming, including branch-and-bound and cutting-plane techniques. This course provides the foundations for further studies in convex optimization, combinatorial optimization, and stochastic programming. Graduate/Undergraduate Equivalency: CMOR 541. Recommended Prerequisite(s): CAAM 378 or CMOR 360 or CMOR 303 or MATH 355 or MATH 354