VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Special Topics in Linear Programming
Last Updated: 2026-02-05 14:57:16
Objective
Introduce the students to recent and powerful techniques to solve certain classes of linear programming problems with special interest in efficient algorithms for large scale problem instances. Expose students to current research areas in linear programming.
Content
Nowadays the use of linear programming is almost pervasive across engineering disciplines. Part of the reason of its popularity has been the practical effectiveness of interior point methods and the half-a century old simplex method. However for many practical large scale instances of linear programming these solution methods are not efficient (either in running time or memory utilization). In this class we consider alternative approaches more adequate for solving large scale linear programming problems that are provable efficient. The class is intended for students with some background and interest in optimization and algorithms. Brief introduction to interior point methods. Combinatorial algorithms for linear programming: - Multicommodity flow problems - Generalized fractional Steiner tree problem - Nonnegative linear programming and packing and covering problems - Distributed algorithms - Randomized algorithms Integer primal-dual algorithms.
General Information
- Language
- English
Examination
- Type
- session examination
- Mode
- oral 30 minutes
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Special Topics in Linear Programming |
|
2 h weekly |
| exercise | Special Topics in Linear Programming |
|
2 h weekly |