Integer Programming credit:

4 Hours

Optimization of linear systems over discrete decision domains. Topics to be covered include Modeling, Polyhedral theory, Integral Polyhedra, Totally Unimodular Matrices, Total Dual Integrality, Computational Complexity, Cutting plane method, Branch and Bound method, and Lagrangian Dual. Structured integer programs involving Matchings, Knapsack, Cuts and Matroids will be studied as applications. Prerequisite: IE 411 or MATH 482 .