Quantifying Double McCormick
From MaRDI portal
Publication:4595965
DOI10.1287/moor.2017.0846zbMath1386.90121arXiv1508.02966OpenAlexW2951623144MaRDI QIDQ4595965
Publication date: 7 December 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02966
global optimizationconvexificationmixed-integer nonlinear programmingbilinearspatial branch and boundtrilinearMcCormick inequalities
Related Items
Gaining or losing perspective, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, On linear programming relaxations for solving polynomial programming problems, Error bounds for monomial convexification in polynomial optimization, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, The Convex Hull of a Quadratic Constraint over a Polytope, A new framework to relax composite functions in nonlinear programs, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Experimental validation of volume-based comparison for double-McCormick relaxations, A conic relaxation model for searching for the global optimum of network data envelopment analysis, Volume computation for sparse Boolean quadric relaxations, Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes, Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
