Models and bounds¶
Part I of the course. What an integer linear programming problem is (MIP, ILP, BIP), its solutions and outcomes; primal and dual bounds, the gap and the LP relaxation.
-
1. Integer linear programming
Canonical maximization form · Possible outcomes · Complete enumeration · Typical mistakes · …
-
2. Primal and dual bounds
Primal and dual bounds · Primal bounds: heuristic solutions · The LP relaxation · Rounding the solution of the LP relaxation · …