Integer Programming

Catalog description

This course aims to provide a unifying exposition of mathematical theory and algorithms to solve integer linear programs, application of which includes scheduling, production planning, network optimization, transportation and assignment problems, etc. In particular, Integer Programming (IP) is a requisite when tackling problems involving a number of interrelated “yes-or-no” questions, which is of great importance in decision making optimization. The course will cover various topics such as 1) Introduction to Integer Programming, 2) Simplex and Beale Tableaus, 3) Cutting Plane Techniques, 4) Dual Fractional MILP Cut, 5) Dual All-Integer Integer Programming, 6) Primal All-Integer Integer Programming, and 7) Branch and Bound Enumeration. Prerequisites: SSIE 553 (Operations Research), or permission of the instructor. Term offered varies.