The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings
In this paper, we consider set optimization problems where the solution concept is given by the set approach. Specifically, we deal with the lower less and the upper less set relations. First, we derive the convexity and Lipschitzianity of suitable scalarizing functionals under the assumption that the set-valued objective mapping has certain convexity and Lipschitzianity properties. Then, we obtain upper estimates of the limiting subdifferential of these functionals. These results, together with the properties of the scalarization functionals, allow us to obtain a Fermat rule for set optimization problems with Lipschitzian data.
math.OC↗