On compromise solutions in multiple objective programming

M. Soleimani-Damaneh, M. Zamani

Research output: Contribution to journalArticleScientificpeer-review

Abstract

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.
Original languageEnglish
Pages (from-to)383-390
JournalRAIRO - Operations Research
Volume52
Issue number2
DOIs
Publication statusPublished - 2018
Externally publishedYes

Fingerprint

Dive into the research topics of 'On compromise solutions in multiple objective programming'. Together they form a unique fingerprint.

Cite this