On generalized approximate convex functions and variational inequalities
Bhuwan Chandra Joshi · RAIRO - Operations Research · 2020
In this paper, we consider a vector optimization problem involving locally Lipschitz generalized approximately convex functions and provide several concepts of approximate efficient solutions. We formulate approximate vector variational inequalities of Minty and Stampacchia type under the framework of Clarke subdifferentials and use these inequalities as a tool to characterize an approximate efficient solution of the vector optimization problem.