The Weighted Set Relation: Characterizations in the Convex Case
Peer reviewed, Journal article
Accepted version
Permanent lenke
https://hdl.handle.net/11250/3141520Utgivelsesdato
2021Metadata
Vis full innførselSamlinger
- Institutt for matematiske fag [2451]
- Publikasjoner fra CRIStin - NTNU [38070]
Originalversjon
Journal of Nonlinear and Variational Analysis. 2021, 5 (5), 721-735. 10.23952/jnva.5.2021.5.07Sammendrag
Optimization of set-valued mappings has become an important subbranch of optimization. In set optimization, one of the main tools to compare sets is given by set relations, which are binary relations among sets. The main two set relations known in the literature are the upper and lower set relation, which are somewhat counterparts of each other and are used to model robust and optimistic solutions in uncertain (vector) programming, respectively. In this paper, we consider the convex case and propose a new set relation which is able to act as a weighting function between these two important set relations and therefore balances out possible gaps that can occur in modeling set optimization problems.