We introduce a class of positively homogeneous set-valued mappings, called inner prederivatives, serving as first order approximants to set-valued mappings. We prove an inverse mapping theorem involving such prederivatives and study their stability with respect to variational perturbations. Then, taking advantage of their properties we establish necessary optimality conditions for the existence of several kind of minimizers in set-valued optimization. As an application of these last results, we consider the problem of finding optimal allocations in welfare economics. Finally, to emphasize the interest of our approach, we compare the notion of inner prederivative to the related concepts of set-valued differentiation commonly used in the literature.
On Nonsmooth Semi-Infinite Minimax Programming Problem with(Φ,ρ)-Invexity
