Advanced Topics of Linear Programming and Combinatorial Optimization
Fortgeschrittene Kapitel der linearen Programmierung und kombinatorischen Optimierung
6 CPirregularlyEN
Prerequisites
Recommended, as written
Knowledge of subject matters from the modules • 13862: Optimierung und Operations Research • 13392: Differenzierbare Optimierung resp. 14356: Differentiable Optimization
Contents
In-depth topics in linear and mixed-integer optimization, for which there was no room in the introductory courses, are addressed in this lecture. Examples are: • Ellipsoid method and inner-point methods for solving linear programs • Robust optimization • Stochastic optimization • Multilevel optimization • Multicriteria optimization • Lagrangian methods • Special cutting plane techniques • Benders decomposition • Dantzig-Wolfe decomposition • Column generation methods • Polyhedral theory • Network simplex methods
Learning outcomes
After successfully completing the module, students will have in-depth knowledge and understanding in the area of linear and mixed-integer programming.
Assessment
• Oral examination, 30 minutes
Literature (1)
- Current literature will be given in the first lecture.
Remarks
• Study programme Mathematics M.Sc.: Compulsory elective module in complex „Optimization“
Source: BTU's module description · retrieved 29 Sep 2026Original