Abstract There are two types of criteria of solutions for the set-valued optimization problem, the vectorial criterion and set optimization criterion. The first criterion consists of looking for efficient points of set valued map and is called set-valued vector optimization problem. On the other hand, Kuroiwa–Tanaka–Ha started developing a new approach to set-valued optimization which is based on comparison among values of the set-valued map. In this paper, we treat the second type criterion and call set optimization problem. The aim of this paper is to investigate four types of nonlinear scalarizing functions for set valued maps and their relationships. These scalarizing functions are generalization of Tammer–Weidner’s scalarizing functions for vectors. As applications of the scalarizing functions for sets, we present nonconvex separation type theorems, Gordan’s type alternative theorems for set-valued map, optimality conditions for set optimization problem and Takahashi’s minimization theorems for set-valued map.
[1]
H. Riahi,et al.
Variational Methods in Partially Ordered Spaces
,
2003
.
[2]
Andreas H. Hamel,et al.
Minimal element theorems and Ekeland's principle with set relations
,
2006
.
[3]
Daishi Kuroiwa,et al.
On cone of convexity of set-valued maps
,
1997
.
[4]
Yousuke Araya.
Nonlinear scalarizations and some applications in vector optimization
,
2010
.
[5]
Luis Rodríguez-Marín,et al.
Existence theorems for set optimization problems
,
2007
.
[6]
Daishi Kuroiwa,et al.
On set-valued optimization
,
2001
.
[7]
L. Rodríguez-Marín,et al.
Nonconvex scalarization in set optimization with set-valued maps
,
2007
.
[8]
C. Gerth,et al.
Nonconvex separation theorems and some applications in vector optimization
,
1990
.
[9]
Yousuke Araya,et al.
On generalizing Takahashi's nonconvex minimization theorem
,
2009,
Appl. Math. Lett..