IE 573LEC - Discrete Optimization

Basic theory of Discrete Optimization as well as the computational strategies for exact and heuristic solution of problems having discrete decision variables. Discrete Models can be divided into two main categories: Integer Programming and Combinatorial Optimization. Integer programming encompasses models with a mixture of discrete and continuous decision variables, and ones for which efficient algorithms are not likely to be found. On the other hand combinatorial models may deal with problems having pure discrete elements for which clean and efficient procedures exist. This latest class includes Network Optimization. This course will place emphasis on Integer Programming and related areas. The course is a good one for students who are planning to apply OR tools in Production or Manufacturing problems or supply chain/service/logistics related problems as well as continue using an optimization software tool called CPLEX.

Credits: 3