The aim of this paper is to extend some notions of proper minimality from vector optimization to set optimization. In particular, we focus our attention on the concepts of Henig and Geoffrion proper minimality, which are well-known in vector optimization. We introduce a generalization of both of them in set optimizatio nwith finite dimensional spaces, by considering also a special class of polyhedral ordering cones. In this framework, we prove that these two notions are equivalent, as it happens in the vector optimization context, where this property is well-known. Then, we study a characterization of these proper minimal points through nonlinear scalarization, without considering convexity hypotheses.
On proper minimality in set optimization
Molho E.;
2024-01-01
Abstract
The aim of this paper is to extend some notions of proper minimality from vector optimization to set optimization. In particular, we focus our attention on the concepts of Henig and Geoffrion proper minimality, which are well-known in vector optimization. We introduce a generalization of both of them in set optimizatio nwith finite dimensional spaces, by considering also a special class of polyhedral ordering cones. In this framework, we prove that these two notions are equivalent, as it happens in the vector optimization context, where this property is well-known. Then, we study a characterization of these proper minimal points through nonlinear scalarization, without considering convexity hypotheses.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
