On the Regularity Condition for Vector Programming Problems

In this work, we use a notion of approximation derived from Jourani and Thibault 13] to ascertain optimality conditions analogous to those that established but applicable to larger class of vector valued objective mappings and constraint set-valued mappings. To this end, we introduce an appropriate regularity condition to help us discern the Karush-Kuhn-Tucker multipliers.