The course is about linear and discrete optimization. We will learn about linear programming, the simplex method, the geometry of polyhedra, and how to solve some discrete optimization problems like bipartite matching, shortest paths, and flows.
- Professor: Adam Wade Marcus
- Teacher: Boubacar Arthur Bangoura
- Teacher: Gaëtan Yann Quentin Bossy
- Teacher: Jana Tabea Cslovjecsek
- Teacher: Jan Hazla
