Page
%P
-
Article
Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
In spatial branch-and-bound algorithms, optimality-based domain reduction is normally performed after solving a node and relies on duality information to reduce ranges of variables. In this work, we propose no...