On the convex hull of the graph of a simple monomial

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lee, Jon, Skipper, Daphne, Speakman, Emily
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915974316294144
author Lee, Jon
Skipper, Daphne
Speakman, Emily
author_facet Lee, Jon
Skipper, Daphne
Speakman, Emily
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2605_01493
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On the convex hull of the graph of a simple monomial
Lee, Jon
Skipper, Daphne
Speakman, Emily
Optimization and Control
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.
title On the convex hull of the graph of a simple monomial
topic Optimization and Control
url https://arxiv.org/abs/2605.01493