ABSTRACT
We introduce and study two directional derivatives adapted to the case of set optimization. We motivate our approach by the novelty and the flexibility of these constructions for set optimization problems and by their relations, in some particular cases, to known objects of generalized differentiation. We prove optimality conditions for unconstrained problems on the basis of these derivatives and we extend these conditions to constrained problems by means of a penalization result and some calculus rules.
Acknowledgements
The authors are thankful for the reviewers' constructive remarks that improved the presentation of the paper.
Disclosure statement
No potential conflict of interest was reported by the author(s).