.png){kind=icon}
返回
Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2020.105178.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present two new algorithms for a class of single-objective non-linear optimization problems, the socalled Mixed Integer Linear minimum Multiplicative Programs (MIL-mMPs). This class of optimization problems has a desirable characteristic: a MIL-mMP can be viewed as a special case of the problem of optimization over the efficient set in multi-objective optimization. The proposed algorithms exploit this characteristic and solve any MIL-mMP from the viewpoint of multi-objective optimization. A computational study on 960 instances demonstrates that the proposed algorithms outperform a generic purpose solver, SCIP, by a factor of more than 10 on many instances. We numerically show that selecting the best algorithm among our proposed algorithms highly depends on the class of instances used. Specifically, since one of the proposed algorithms is a decision space search algorithm and the other one is a criterion space search algorithm, one can significantly outperform the other depending on the dimension of decision space and criterion space. Although it is possible to linearize some instances of MIL-mMPs, we show that a commercial solver, CPLEX, struggles to directly solve such linearized instances because linearization introduces additional constraints and binary decision variables. (c) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Multi-objective optimization
Minimum multiplicative programming
Optimization over the efficient set
Decision space search algorithm
Criterion space search algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
On finding representative non-dominated points for bi-objective integer network flow problems关于寻找双目标整数网络流问题的代表性非支配点
PREAI
分享收藏分享收藏
查看更多内容