Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes

DOI10.1016/J.DAM.2019.09.007zbMATH Open1484.52004arXiv1810.12625OpenAlexW2975971813MaRDI QIDQ2064282FDOQ2064282

Authors: Emily Speakman, Gennadiy Averkov 

Publication date: 5 January 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1{x}_2{x}_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in the context of using volume as a measure for comparing alternative convexifications to guide the implementation of spatial branch-and-bound for mixed integer nonlinear optimization problems. Here, we introduce an alternative method for computing this volume, making use of the rich theory of mixed volumes. This new method may lead to a natural approach for considering extensions of the problem.

Full work available at URL: https://arxiv.org/abs/1810.12625

Recommendations

• Unmixing the mixed volume computation
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• scientific article; zbMATH DE number 665697
• Convex hull representations of special monomials of binary variables

zbMATH Keywords

mixed volumeconvexificationspatial branch-and-bound

Mathematics Subject Classification ID

Mixed volumes and related topics in convex geometry (52A39)

Cites Work

• Convex Bodies The Brunn-MinkowskiTheory
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A convex envelope formula for multilinear functions
• A branch-and-reduce approach to global optimization
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
• The Convex Envelope of (n–1)-Convex Functions
• Title not available (Why is that?)
• Theoretical challenges towards cutting-plane selection
• Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
• Geometric comparison of combinatorial polytopes
• Quantifying double McCormick
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation

Cited In (4)

• Gaining or losing perspective
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• Volumes of \(s\)-Orlicz convex simplices and geometric inequalities in higher dimensional spaces
• Different Volume Computation Methods of Graph Polytopes

This page was built for publication: Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064282)