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: Amire Bendjeddou
- Teacher: Noé Romain Alexis Hollande
- Teacher: Reihaneh Malekian
- Teacher: Tanish Patil
