Volume 52, Number 2, April–June 2018
|Page(s)||383 - 390|
|Published online||22 June 2018|
On compromise solutions in multiple objective programming
School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Enghelab Avenue,
* Corresponding author: e-mail: email@example.com
Accepted: 5 October 2017
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.
Mathematics Subject Classification: 90C29
Key words: Multiple objective programming / compromise solution / properly efficient solution
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.