Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 70, Issue 3, Pages 497-516Publisher
SPRINGER
DOI: 10.1007/s10898-017-0559-0
Keywords
Global optimization; Mixed-integer nonlinear programming; Mixed-integer linear programming; Parallel computing; Multicore architectures; Portfolios of relaxations
Funding
- National Natural Science Foundation of China-Zhejiang Joint Fund for the Integration of Industrialization and Informatization [U1509209]
- China Scholarship Council
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available