On approximate vector variational inequalities and vector optimization problem using convexificator

Abstract

<abstract><p>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.</p></abstract>

Interval Valued Vector Variational Inequalities and Vector Optimization Problems via Convexificators

“…Convexificators were recently employed by Golestani and Nobakhtian [8], Li and Zhang [19], Long and Huang [20] and Luu [21] to create the ideal circumstances for nonsmooth optimization problems. We refer to [3,4,12,16,17,18,35], and its sources for further details on convexificators.…”

On interval-valued vector variational-like inequalities and vector optimization problems with generalized approximate invexity via convexificators

“…Convexificators were recently employed by Golestani and Nobakhtian [6], Long and Huang [15] and Luu [17] to create the ideal circumstances for nonsmooth optimization problems. We refer to [12,13,18], and its sources for further details on convexificators.…”