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 W. Marcus
- Teacher: Boubacar Arthur Bangoura
- Teacher: Gaetan Yann Quentin Bossy
- Teacher: Jan Hazla
- Teacher: Reihaneh Malekian
- Teacher: Clémence Clotilde Marcaillou
- Teacher: Justine Carine Montavon