Q773 - Mathematical Programming: Theory and Algorithms
The course will cover topics in linear, integer and nonlinear programming. Concepts to be covered include convexity, duality, Karush-Kuhn-Tucker conditions, non-differentiable optimization, Branch and cut, and decomposition methods (Lagrangian, Bender’s and Dantzig-Wolf). Software implementation issues will be highlighted via GAMS and its solvers.
Course Offerings Archive Submission Form
If you need an outline from an earlier semester, please use this form to contact us. Outlines for current and future courses will be posted here on the website as they become available.