.png){kind=icon}
返回
Compounding problem in an interactive multiple objective optimization method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.08.049.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This note finds and resolves a compounding problem in the interactive multi-objective optimization method developed by Park and Shin (2012). The compounding problem means that the algorithm generates a solution unexpected by the decision maker. A concrete example of the compounding problem is demonstrated and, to remove the problem, an improved algorithm is then developed. We also show that the improved algorithm converges to the known optimal solutions faster than the earlier algorithm. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Keyword:
Multi-objective programming
Interactive method
Compounding problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
.png){kind=icon}
