On Benson’s scalarization in multiobjective optimization

M. Soleimani-damaneh, M. Zamani

Research output: Contribution to journalArticleScientificpeer-review

Abstract

In this paper, a popular scalarization problem in multiobjective optimization, introduced by Benson, is considered. In the literature it was proved that, under convexity assumption, the set of properly efficient points is empty when the Benson’s problem is unbounded. In this paper, it is shown that this result is still valid in general case without convexity assumption.
Original languageEnglish
Pages (from-to)157-1762
JournalOptimization Letters
Volume10
DOIs
Publication statusPublished - 2016
Externally publishedYes

Fingerprint

Dive into the research topics of 'On Benson’s scalarization in multiobjective optimization'. Together they form a unique fingerprint.

Cite this