This course builds on the Mathematical Programming course and contains modeling and solving techniques for complex problems where the decision variables form a discrete set and/or that cannot be solved in polynomial time. Topics include model development, branch and bound methods, cutting plane methods such as Gomory's cutting plane procedure and branch-and-cut, relaxations such as Lagrangian relaxation method, computational complexity and NP-completeness. (Knowledge of Mathematical Programming is recommended)