Discrete OptimizationVorlesung im Sommersemester 2022
4 V + 2 S
The development of solving techniques for linear programming tasks are a huge contribution of Mathematics to the solution of practical optimization problems. This course is an introduction both into the theory and the application of linear and integer optimization. We will cover the theoretical background as well as algorithmic ideas and practical applications. Main topics that we will cover in the course are the Simplex Method, Ellipsoid Method, Interior Point Method, Cutting Planes, Branch & Bound, LP Duality, and Polyhedral Theory.