Many cutting planes in MINLP heavily rely on the bound of the variables. In this talk, we consider the possibility of generating a cutting plane from a reduced domain while still ensuring the validity of them. We formalize this idea using the separation problem and the reverse polar. Relying on the concept of visible points, we provide a simple procedure to shrink the domain of the variables when constructing cutting planes for quadratic constraints.
Bio: Felipe Serrano studied applied mathematics at Universidad de Chile where he also did the master on operations research (MGO). After graduating at the beginning of 2012 he started working at Zuse Institute Berlin as a developer of the MINLP solver SCIP.
Bienvenue à tous!