Extended formulations for convex heptagons

DOI10.1134/S1064562415060186MaRDI QIDQ265972zbMATH OpenFDO

Authors Ya. N. Shitov

Publication date 13 April 2016

Published in Doklady Mathematics (Search for Journal in Brave)

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)

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

Cites work

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

Cited in

(5)

• Hidden vertices in extensions of polytopes
• Homology of a type of heptahedron
• scientific article; zbMATH DE number 21733 (Why is no real title available?)
• 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)