This course considers modeling and optimization aspects of mixed-integer linear programming (or integer programming for short). This important subdomain of mathematical programming and extension of linear programming considers the problem of optimizing a linear function of many variables, some or all of them restricted to be integers, subject to linear constraints.
Integer programming is a thriving area of optimization. It has countless applications in production planning and scheduling, logistics, layout planning and revenue management, to name just a few. Thanks to effective and reliable software, it is widely applied in industry to improve decision-making.
In this course, we cover the theory and practice of integer programming. In the first part, we address mathematical modeling aspects. We discuss how integer variables can be used to model various practically relevant, complex decision problems. We then introduce some standard optimization problems and develop, analyze and compare different integer programming formulations for them. We also introduce powerful modeling and solving tools and test them on the optimization problems given in the course. In the second part, we address optimization aspects, in which we discuss the basic methodology applied to solve integer programs. In particular, we consider implicit enumeration techniques (branch and bound), polyhedral theory, cutting planes and primal heuristics. We also look at some advanced techniques, such as Danzig-Wolfe decomposition and column generation.
T5 – Information Systems and Decision Support |
With this course, the students gain the ability to formulate and solve practically relevant decision problems using integer programming, and they understand the basic methodology for solving integer programs and its implications with respect to modeling decisions.
Reinhard Bürgy |
The course page in ILIAS can be found at https://ilias.unibe.ch/goto_ilias3_unibe_crs_1841378.html.
Schedules and Rooms
|Schedule||Thursday, 13:15 - 16:00|