Online Course Catalog
IE 511 - Integer Programming
Spring 2021
| Title | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|
| Integer Programming | L | 34285 | ONL | 4 | 0930 - 1050 | T R | Karthekeyan Chandrasekaran |
Course Description
This course covers optimization of linear systems over discrete decision domains. Topics 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.
Credit Hours
4 hours
Prerequisites
Subject Area
- Industrial and Enterprise Systems Engineering