In this paper, we establish some results which exhibit an application of convexificators in vector optimization problems (VOPs) and vector variational inequaities involving locally Lipschitz functions. We formulate vector variational inequalities of Stampacchia and Minty type in terms of convexificators and use these vector variational inequalities as a tool to find out necessary and sufficient conditions for a point to be a vector minimal point of the VOP. We also consider the corresponding weak versions of the vector variational inequalities and establish several results to find out weak vector minimal points.

In this paper, we consider the multiobjective optimization problems involving the differentiable V-r-invex vector valued functions. Under the assumption of V-r-invexity, we use the Stampacchia type vector variational-like inequalities as tool to solve the vector optimization problems. We establish equivalence among the vector critical points, the weak efficient solutions and the solutions of the Stampacchia type weak vector variational-like inequality problems using Gordan?s separation theorem under the V-r-invexity assumptions. These conditions are more general than those appearing in the literature.