LINEAR AND INTEGER PROGRAMMING

Credit Hours: 3 · Undergraduate Upper-Level

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