Abstract
Set-valued optimization problems are important and fascinating field of optimization theory and widely applied to image processing, viability theory, optimal control and mathematical economics. There are two types of criteria of solutions for the set-valued optimization problems: the vector criterion and the set criterion. In this paper, we adopt the set criterion to study the optimality conditions of constrained set-valued optimization problems. We first present some characterizations of various set order relations using the classical oriented distance function without involving the nonempty interior assumption on the ordered cones. Then using the characterizations of set order relations, necessary and sufficient conditions are derived for four types of optimal solutions of constrained set optimization problem with respect to the set order relations. Finally, the image space analysis is employed to study the c-optimal solution of constrained set optimization problems, and then optimality conditions and an alternative result for the constrained set optimization problem are established by the classical oriented distance function.
Acknowledgements
The authors are grateful to the handling editor and the two anonymous referees for their valuable comments and suggestions, which have helped to improve the previous version of the paper. Authors are also thankful to Professors Andreas H. Hamel, Elisabeth Köbis and Markus A. Köbis for their valuable discussion and suggestions.
Notes
No potential conflict of interest was reported by the authors.