On Benson’s scalarization in multiobjective optimization

M. Soleimani-damaneh; M. Zamani

doi:10.1007/s11590-016-0999-3

On Benson’s scalarization in multiobjective optimization

M. Soleimani-damaneh
, M. Zamani

Research output: Contribution to journal › Article › Scientific › peer-review

4 Citations (Scopus)

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 language	English
Pages (from-to)	157-1762
Journal	Optimization Letters
Volume	10
DOIs	https://doi.org/10.1007/s11590-016-0999-3
Publication status	Published - 2016
Externally published	Yes

Access to Document

10.1007/s11590-016-0999-3

Cite this

@article{38e509aa233d4500b5ac7c17ea35a7d7,

title = "On Benson{\textquoteright}s scalarization in multiobjective optimization",

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{\textquoteright}s problem is unbounded. In this paper, it is shown that this result is still valid in general case without convexity assumption.",

author = "M. Soleimani-damaneh and M. Zamani",

year = "2016",

doi = "10.1007/s11590-016-0999-3",

language = "English",

volume = "10",

pages = "157--1762",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - On Benson’s scalarization in multiobjective optimization

AU - Soleimani-damaneh, M.

AU - Zamani, M.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

U2 - 10.1007/s11590-016-0999-3

DO - 10.1007/s11590-016-0999-3

M3 - Article

SN - 1862-4472

VL - 10

SP - 157

EP - 1762

JO - Optimization Letters

JF - Optimization Letters

ER -

On Benson’s scalarization in multiobjective optimization

Abstract

Access to Document

Fingerprint

Cite this