Discrete Optimisation


Prof. Rom Pinchasi


Eleonore Bach

Jiaye Wei

News & Log

  • 05/02: The TA sessions are going to start on Tuesday, February 21st in CM1105 at 08:30. The classes are going to start Tuesday, February 21st in CM1105 at 10:15


This course is an introduction to linear and discrete optimization. We will discuss linear programming and combinatorial optimization problems like bipartite matchings, shortest paths and flows, the simplex method and way more fun stuff! Warning: This course is for mathematicians! Strong emphasis is put on formal mathematical proofs.


Lecture: Tuesdays 10:15 – 11:45 (CM1105)

Exercises: Tuesdays 8:30 – 10:00 (CM1105)


There will be no midterm exam. There will be a written final exam after the end of the semester. 

Homework problems

We will publish problems on this website every week. You can work on the exercises and ask questions during the exercise sessions. There will be no assignments.

Exercises1, Exercise1_Solutions

Exercises_2, Exercise2_Solutions

Exercises_3, Exercise3_Solutions

Exercise_4, Exercise4_Solutions 

Exercise_5, Exercise5_Solutions

Exercise_6, Exercise6_Solutions

Exercise_7, Exercise7_Solutions

Exercise_8, Exercise8_Solutions

Exercise9, Exercise9_Solutions_up

Exercise10, Exercise10_Solutions

Exercise11_update, Exercise11_Solutions

Exercise12, Exercise12_Solutions

Exercise13, Exercise13_Solutions



These notes are suggestions. They do not exactly cover the contents of the classes and also contain some content not covered by the classes. They do not replace the classes.

  1. Alexander Schrijver, Theory of Linear and Integer Programming.
  2. Dimitris Bertsimas, John N. Tsitsiklis, Introduction to Linear Optimisation.
  3. Thomas Rothvoss, Discrete Optimization, Course Notes (online version).