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

From MaRDI portal
scientific article
Language Label Description Also known as
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
    0 references
    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
    0 references
    spatial branch-and-bound
    0 references
    convexification
    0 references
    mixed volume
    0 references
    0 references
    0 references