In this paper, we study the concept of approximate directional efficiency for set-valued constrained and unconstrained optimization problems. In our work, we concerned with finding conditions under which the Clarke… Click to show full abstract
In this paper, we study the concept of approximate directional efficiency for set-valued constrained and unconstrained optimization problems. In our work, we concerned with finding conditions under which the Clarke penalization technique can be applied, and we derive some optimality conditions via variational analysis tools such as limiting normal cones and its corresponding normal coderivative.
               
Click one of the above tabs to view related content.