Abstract
In this paper, we study the norm-based robust (efficient) solutions of a vector optimization problem. We define two kinds of non-ascent directions in terms of Clarke’s generalized gradient and characterize norm-based robustness by means of the newly defined directions. This is done under a basic constraint qualification. We extend the provided characterization to vector optimization problems with conic constraints and semi-infinite ones. Moreover, we derive a necessary condition for norm-based robustness utilizing a non-smooth gap function.
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.
