Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
From MaRDI portal
Publication:517317
DOI10.1007/s10107-016-1031-5zbMath1384.90073arXiv1507.08703OpenAlexW2247587955WikidataQ57955268 ScholiaQ57955268MaRDI QIDQ517317
Santanu S. Dey, Marco Molinaro, Natashia Boland, Fabian Rigterink, Thomas Kalinowski
Publication date: 23 March 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.08703
Related Items (12)
Exact and approximate results for convex envelopes of special structured functions over simplices ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ Tractable Relaxations of Composite Functions ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon ⋮ (Global) optimization: historical notes and recent developments ⋮ A new framework to relax composite functions in nonlinear programs ⋮ Convexification of bilinear forms through non-symmetric lifting ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concave extensions for nonlinear 0-1 maximization problems
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- BARON: A general purpose global optimization software package
- Some results on the strength of relaxations of multilinear functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Branching and bounds tighteningtechniques for non-convex MINLP
- Jointly Constrained Biconvex Programming
- Cutting a graph into two dissimilar halves
- The best constants in the Khintchine inequality
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Imbalances in k‐colorations
This page was built for publication: Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
