7 papers · 1 filter
On obtaining the convex hull of quadratic inequalities via aggregations
Santanu S. Dey, Gonzalo Munoz, Felipe Serrano
A classical approach for obtaining valid inequalities for a set involves weighted aggregations of the inequalities that describe such set. When the set is described by linear inequ…
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
Benjamin Müller, Gonzalo Muñoz, Maxime Gasse +3
The most important ingredient for solving mixed-integer nonlinear programs (MINLPs) to global epsilon-optimality with spatial branch and bound is a tight, computationally tractable…
Maximal quadratic-free sets
Gonzalo Muñoz, Felipe Serrano
The intersection cut paradigm is a powerful framework that facilitates the generation of valid linear inequalities, or cutting planes, for a potentially complex set S. The key ingr…
Visible points, the separation problem, and applications to MINLP
Felipe Serrano
In this paper we introduce a technique to produce tighter cutting planes for mixed-integer non-linear programs. Usually, a cutting plane is generated to cut off a specific infeasib…
On the Relation between the Extended Supporting Hyperplane Algorithm and Kelley's Cutting Plane Algorithm
Felipe Serrano, Robert Schwarz, Ambros Gleixner
Recently, Kronqvist et al.~\cite{KronqvistLundellWesterlund2016} rediscovered the supporting hyperplane algorithm of Veinott~\cite{Veinott1967} and demonstrated its computational b…
Using two-dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
Benjamin Müller, Felipe Serrano, Ambros Gleixner
One of the most fundamental ingredients in mixed-integer nonlinear programming solvers is the well-known McCormick relaxation for a product of two variables x and y over a box-cons…