Comparison of Some Scalarization Methods in Multiobjective Optimization

Bulletin of the Malaysian Mathematical Sciences Society(2017)

引用 29|浏览2
暂无评分
摘要
The paper presents an analysis, characterizations and comparison of six commonly used scalarization methods in multiobjective optimization. The properties of these methods are investigated with respect to the basic characteristics such as ordering cone, convexity and boundedness, the ability of generating proper efficient solutions, the ability to consider reference points which is a choice of decision maker as a solution and weighting preferences of decision maker, the number of additional constraints and decision variables. The paper also presents new characteristics for these methods and relations between them. The main characteristics of these scalarization methods are illustrated on the same example.
更多
查看译文
关键词
Conic scalarization method,Weighted sum method,$$\varepsilon $$ε-Constraint method,Benson’s method,Weighted Chebyshev method,Pascoletti–Serafini method,Multiobjective optimization,Proper efficiency,65K05,90C26,90C29,90C30
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要