This lecture covers the theory of linear and integer programming, focusing on topics such as the integer hull, convex sets, polyhedra, and linear programs. It also discusses the Minkowski-Weyl theorem and rational polyhedra.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer s
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
