Mathematical Programming: Theory and Algorithms
ChE 756

Cross listed with Business Q773. 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.

Instructor(s): To be announced
Term offered: 2
Course level: 700-level
Course outline: Not available
Restrictions: N/A
Co/pre-requisite(s) that may apply: N/A (but confirm on the official registrar page)
Course website: Avenue website

All undergraduate courses All graduate courses