arrow
返回

A combined scalarizing method for multiobjective programming problems

delete2014-07-01
delete25
PRE
AI
N
Narges Rastegar
E
Esmaile Khorram *
DOI:10.1016/j.ejor.2013.11.020delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, a new general scalarization technique for solving multiobjective optimization problems is presented. After studying the properties of this formulation, two problems as special cases of this general formula are considered. It is shown that some well-known methods such as the weighted sum method, the epsilon-constraint method, the Benson method, the hybrid method and the elastic epsilon-constraint method can be subsumed under these two problems. Then, considering approximate solutions, some relationships between epsilon-(weakly, properly) efficient points of a general (without any convexity assumption) multiobjective optimization problem and epsilon-optimal solutions of the introduced scalarized problem are achieved. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Multiple objective programming
Scalarization method
Approximate solutions
Properly efficient solutions
epsilon-Properly efficient solutions
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

A
Amirkabir University of Technology
学者数:
1.1W
论文数: 1.1W
被引数: 1.0W
引用论文

引用论文

An MCDM approach to portfolio optimization
err2004-06-01
err211
PREAI
errEhrgott, M; Klamroth, K; Schwehm, C
err分享
err收藏
学者 查看更多内容