Extended formulations for convex heptagons

DOI10.1134/S1064562415060186zbMATH Open1345.52003MaRDI QIDQ265972FDOQ265972

Authors: Ya. N. Shitov 

Publication date: 13 April 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

Recommendations

• Extended formulations for polygons
• Hidden vertices in extensions of polytopes
• Polygons as sections of higher-dimensional polytopes
• Small extended formulations for cyclic polytopes
• On the linear extension complexity of regular \(n\)-gons

zbMATH Keywords

convex polygonsextended formulationslinear inequalities

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites Work

• Real rank versus nonnegative rank
• Expressing combinatorial optimization problems by linear programs
• On the geometric interpretation of the nonnegative rank
• Hidden vertices in extensions of polytopes
• An upper bound for nonnegative rank
• Polytopes of minimum positive semidefinite rank
• Extended formulations in combinatorial optimization
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• Extended formulations for polygons

Cited In (5)

• Homology of a type of heptahedron
• Hidden vertices in extensions of polytopes
• Title not available (Why is that?)
• Polygons as sections of higher-dimensional polytopes
• Resummed tree heptagon

This page was built for publication: Extended formulations for convex heptagons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265972)