Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (Q2064282): Difference between revisions

The volume of the convex hull of the graph of the monomial \(y = x_1x_2x_3\), over a box in the nonnegative orthant is computed. The problem is related to the spatial branch-and-bound algorithmic framework for the factorable mixed integer nonlinear optimization problems.