An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver |
| |
Authors: | Kai Zhou Mustafa R K?l?nç Xi Chen Nikolaos V Sahinidis |
| |
Institution: | 1.State Key Laboratory of Industrial Control Technology, College of Control Science and Engineering,Zhejiang University,Hangzhou,China;2.Department of Chemical Engineering,Carnegie Mellon University,Pittsburgh,USA |
| |
Abstract: | Solving mixed-integer nonlinear programming (MINLP) problems to optimality is a NP-hard problem, for which many deterministic global optimization algorithms and solvers have been recently developed. MINLPs can be relaxed in various ways, including via mixed-integer linear programming (MIP), nonlinear programming, and linear programming. There is a tradeoff between the quality of the bounds and CPU time requirements of these relaxations. Unfortunately, these tradeoffs are problem-dependent and cannot be predicted beforehand. This paper proposes a new dynamic strategy for activating and deactivating MIP relaxations in various stages of a branch-and-bound algorithm. The primary contribution of the proposed strategy is that it does not use meta-parameters, thus avoiding parameter tuning. Additionally, this paper proposes a strategy that capitalizes on the availability of parallel MIP solver technology to exploit multicore computing hardware while solving MINLPs. Computational tests for various benchmark libraries reveal that our MIP activation strategy works efficiently in single-core and multicore environments. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|