On the convex hull of the graph of a simple monomial
Optimization and Control
2026-05-05 v1
Abstract
Motivated by previous efforts toward mathematically analyzing the treatment of monomials in spatial branch-and-bound, we study the convex hull of the graph of a simple monomial on a nonnegative box domain in arbitrary dimension, where at most one of the variable lower bounds is positive. We give: (i) a description via linear inequalities, and (ii) a formula for the volume.
Cite
@article{arxiv.2605.01493,
title = {On the convex hull of the graph of a simple monomial},
author = {Jon Lee and Daphne Skipper and Emily Speakman},
journal= {arXiv preprint arXiv:2605.01493},
year = {2026}
}