期刊
OPTIMIZATION AND ENGINEERING
卷 20, 期 2, 页码 397-455出版社
SPRINGER
DOI: 10.1007/s11081-018-9411-8
关键词
Convex MINLP; MINLP solver; Solver comparison; Numerical benchmark
类别
资金
- Abo Akademi University (ABO)
- AIMMS
- GAMS
- Center for Advanced Process Decision-making (CAPD)
- Magnus Ehrnrooth Foundation
- Ruth and Nils-Erik Stenback Foundation
In this paper, we present a review of deterministic software for solving convex MINLP problems as well as a comprehensive comparison of a large selection of commonly available solvers. As a test set, we have used all MINLP instances classified as convex in the problem library MINLPLib, resulting in a test set of 335 convex MINLP instances. A summary of the most common methods for solving convex MINLP problems is given to better highlight the differences between the solvers. To show how the solvers perform on problems with different properties, we have divided the test set into subsets based on the continuous relaxation gap, the degree of nonlinearity, and the relative number of discrete variables. The results also provide guidelines on how well suited a specific solver or method is for particular types of MINLP problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据