Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (Q2064282)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes |
scientific article |
Statements
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (English)
0 references
5 January 2022
0 references
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.
0 references
spatial branch-and-bound
0 references
convexification
0 references
mixed volume
0 references
0 references
0 references
0 references
0.7719809412956238
0 references
0.7402374148368835
0 references
0.7356699705123901
0 references
0.7352218627929688
0 references
