Abstract

In linear programming one can formulate many combinatorial optimization problems as optimizing a linear function over a feasible region that is a polytope. A polytope Q is called an extension of P if Q has an (affine) linear projection into P. The extension complexity xc(P) of P is defined as
... read more