Abstract
In the present article, we study a vector optimization problem involving convexificator-based locally Lipschitz approximately convex functions and give some ideas for approximate efficient solutions. In terms of the convexificator, we approximate Stampacchia-Minty type vector variational inequalities and use them to describe an approximately efficient solution to the nonsmooth vector optimization problem. Moreover, we give a numerical example that attests to the credibility of our results.