The reverse polar of visible points from an infeasible point coincides with that of the full feasible region, enabling tighter valid cuts for MINLPs described by a single non-convex constraint intersected with a convex set.
Journal of Optimization Theory and Applications 175(3), 764–794 (2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Visible points, the separation problem, and applications to MINLP
The reverse polar of visible points from an infeasible point coincides with that of the full feasible region, enabling tighter valid cuts for MINLPs described by a single non-convex constraint intersected with a convex set.