{
  "id": "1810.12625",
  "version": "v1",
  "published": "2018-10-30T10:19:14.000Z",
  "updated": "2018-10-30T10:19:14.000Z",
  "title": "Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes",
  "authors": [
    "Emily Speakman",
    "Gennadiy Averkov"
  ],
  "categories": [
    "math.OC"
  ],
  "abstract": "Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-10-30T10:19:14.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "convex hull",
      "trilinear monomial",
      "mixed volumes",
      "mixed integer nonlinear optimization problems",
      "spatial branch-and-bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}