Weak sharp minima for set-valued vector variational inequalities with an application

In this paper, the notion of weak sharp minima is employed to the investigation of set-valued vector variational inequalities. The gap function φTφT for set-valued strong vector variational inequalities (for short, SVVI) is proved to be less than the gap function ϕTϕT for set-valued weak vector variational inequalities (for short, WVVI) under certain conditions, which implies that the solution set of SVVI is equivalent to the solution set of WVVI. Moreover, it is shown that weak sharp minima for the solution sets of SVVI and WVVI hold for View the MathML sourcemin1⩽i⩽npTi and for gap functions View the MathML sourceφT and View the MathML sourceϕT under the assumption of strong pseudomonotonicity, where pTipTi is a gap function for i -th component of SVVI and WVVI. As an application, the weak Pareto solution set of vector optimization problems (for short, VOP) is proved to be weak sharp minimum for View the MathML sourcemin1⩽i⩽np∇gi when each component gigi of objective function is strongly convex.