|
Samuel Fiorini:
Extended formulations and extension complexity
Abstract: Sometimes, a given convex set can be described as the affine projection of a simpler, higher-dimensional convex set. This powerful idea has been used for decades in optimization. Focussing on the case of polytopes, I will discuss fascinating examples of extended formulations as well as some of their limitations, which are part of the recent theory of extension complexity. |