Abstract
The notions of higher‐order weakly generalized contingent epiderivative and higher‐order weakly generalized adjacent epiderivative for set‐valued maps are proposed. By virtue of the higher‐order weakly generalized contingent (adjacent) epiderivatives, both necessary and sufficient optimality conditions are obtained for Henig efficient solutions to a set‐valued optimization problem whose constraint set is determined by a set‐valued map. The imposed assumptions are relaxed in comparison with those of recent results in the literature. Examples are provided to show some advantages of our notions and results.
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.
