RT info:eu-repo/semantics/article
T1 A scalarization scheme for binary relations with applications to set-valued and robust optimization
A1 Gutiérrez, C.
A1 Huerga, L.
A1 Köbis, E.
A1 Tammer, C.
K1 Binary relations
K1 Minimal solution
K1 Nondominated solution
K1 Strict solution
K1 Scalarization
K1 Representing property
K1 Preserving property
K1 Set optimization
K1 Robust optimization
AB In this paper, a method for scalarizing optimization problems whose final space is endowed with a binary relation is stated without assuming any additional hypothesis on the data of the problem.By this approach, nondominated and minimal solutions are characterized in terms of solutions of scalar optimization problems whose objective functions are the post-composition of the original objective with scalar functions satisfying suitable properties. The obtained results generalize some recent ones stated in quasi ordered sets and real topological linear spaces. Besides, they are applied both to characterize by scalarization approximate solutions of set optimization problems with set ordering and to generalize some recent conditions on robust solutions of optimization problems. For this aim, a new robustness concept in optimization under uncertainty is introduced which is interesting in itself
PB Springer
SN 0925-5001
YR 2021
FD 2021
LK https://uvadoc.uva.es/handle/10324/74148
UL https://uvadoc.uva.es/handle/10324/74148
LA eng
NO Journal of Global Optimization, 2021, vol. 79, n. 1 p. 233-256
NO Producción Científica
DS UVaDOC
RD 22-ene-2025