ON COMPROMISE SOLUTIONS IN MULTIPLE OBJECTIVE PROGRAMMING

被引:2
|
作者
Soleimani-Damaneh, Majid [1 ]
Zamani, Moslem [1 ]
机构
[1] Univ Tehran, Coll Sci, Sch Math Stat & Comp Sci, Enghelab Ave, Tehran, Iran
关键词
Multiple objective programming; compromise solution; properly efficient solution; EFFICIENT SOLUTIONS; PROPER EFFICIENCY; TRADE-OFFS;
D O I
10.1051/ro/2017071
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Compromise solutions, as feasible points as close as possible to the ideal (utopia) point, are important solutions in multiple objective programming. It is known in the literature that each compromise solution is a properly efficient solution if the sum of the image set and conical ordering cone is closed. In this paper, we prove the same result in a general setting without any assumption.
引用
收藏
页码:383 / 390
页数:8
相关论文
共 50 条