Abstract
ABSTRACT Motivated by a work of Dempe and Pilecka [Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming. J Global Optim. 2015;61:769–788], where the authors introduced the notion of directional convexificators, we investigate a set valued optimization problem . Using a scalarization technique by mean of the Hiriart-Urruty signed distance function, together with directional convexificators, we give necessary optimality conditions of . Sufficient optimality conditions are obtained under a new generalized convexity. To illustrate the obtained results, an example is given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
