Integer Optimization
This course addresses modeling and algorithms for integer programming problems, which are constrained optimization problems with integer-valued variables. Flexibility of integer optimization formulations; if-then constraints, fixed-costs, etc. Branch and Bound; Cutting plane methods; polyhedral theory. Applications in production planning, resource allocation, power generation, network design. Alternate formulations for integer optimization: strength of Linear Programming relaxations. Algorithms for integer optimization problems. Specialized strategies by integer programming solvers.
Topics
- • To train students in modeling of integer optimization problems; • To acquire skills in the best modeling approach that is suitable to the practical problem at hand. • Familiarize students in leading methodologies for solving integer optimization problems, and techniques in these methodologies. • To train the students in the selection of appropriate techniques to be used for integer optimization problems. • Enable the students to recognize when problems can be modeled as integer optimization problems.
Official catalogue course objectives and student learning outcomes
Prerequisites & course information
{'preRequisiteCourse': '1147051', 'concurrentPrerequisit': False}; {'preRequisiteCourse': '1147021', 'concurrentPrerequisit': False}
Sources
- Course catalogue ↗2026-2027