Characterization of Norm-Based Robust Solutions in Vector Optimization

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.