Combinatorial Bounds on Nonnegative Rank and Extended Formulations

Details Combinatorial Bounds on Nonnegative Rank and Extended Formulations Combinatorial Bounds on Nonnegative Rank and Extended Formulations

2011-11-02

arxiv.org/abs/1111.0444v1

Mathematics

Combinatorics

23 pages

Scientific paper

An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear programs of small sizes. The main known lower bounds on the minimum sizes of extended formulations for fixed polytope P (Yannakakis 1991) are closely related to the concept of nondeterministic communication complexity. We study the relative power and limitations of the bounds on several examples.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Bounds on Nonnegative Rank and Extended Formulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Bounds on Nonnegative Rank and Extended Formulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Bounds on Nonnegative Rank and Extended Formulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327871