Extended formulations for convex heptagons
From MaRDI portal
Publication:265972
DOI10.1134/S1064562415060186zbMath1345.52003MaRDI QIDQ265972
Publication date: 13 April 2016
Published in: Doklady Mathematics (Search for Journal in Brave)
(n)-dimensional polytopes (52B11) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- Polytopes of minimum positive semidefinite rank
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Extended formulations for polygons
- 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
- Extended formulations in combinatorial optimization
This page was built for publication: Extended formulations for convex heptagons
