期刊
CONSTRAINTS
卷 22, 期 3, 页码 338-376出版社
SPRINGER
DOI: 10.1007/s10601-016-9267-5
关键词
Constraint propagation; Feasibility-based bounds tightening; Optimality-based bounds tightening; Domain reduction
Optimization solvers routinely utilize presolve techniques, including model simplification, reformulation and domain reduction techniques. Domain reduction techniques are especially important in speeding up convergence to the global optimum for challenging nonconvex nonlinear programming (NLP) and mixed-integer nonlinear programming (MINLP) optimization problems. In this work, we survey the various techniques used for domain reduction of NLP and MINLP optimization problems. We also present a computational analysis of the impact of these techniques on the performance of various widely available global solvers on a collection of 1740 test problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据