Title : ( On compromise solutions in multiple objective programming )
Authors: Majid Soleimani-damaneh , Moslem Zamani ,
Full TextAbstract
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.
Keywords
, Multiple objective programming, compromise solution, properly efficient solution
@article{paperid:1078844,
author = {Majid Soleimani-damaneh and Zamani, Moslem},
title = {On compromise solutions in multiple objective programming},
journal = {RAIRO - Operations Research},
year = {2018},
volume = {52},
number = {2},
month = {April},
issn = {0399-0559},
pages = {383--390},
numpages = {7},
keywords = {Multiple objective programming; compromise solution; properly efficient solution},
}
%0 Journal Article
%T On compromise solutions in multiple objective programming
%A Majid Soleimani-damaneh
%A Zamani, Moslem
%J RAIRO - Operations Research
%@ 0399-0559
%D 2018
