A complete linear inequality description and volume formula are derived for the convex hull of the graph of a monomial on a nonnegative box with at most one positive lower bound.
Jr.: Geometric comparison of combinatorial polytopes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the convex hull of the graph of a simple monomial
A complete linear inequality description and volume formula are derived for the convex hull of the graph of a monomial on a nonnegative box with at most one positive lower bound.