Generalized Lagrangian Duality in Set-valued Vector Optimization via Abstract Subdifferential

Optimality and Duality of Approximate Quasi Weakly Efficient Solution for Nonsmooth Vector Optimization Problems

“…It is known that duality assertions allow to study a minimization problem through a maximization problem and to know what one can expect in the best case. ere are many dual models in the literature, for instance, Lagrange dual (see [15,16]), Mond-Weir duality (see [17][18][19]), Wolfe duality (see [17,20]), conjugate duality (see [21]), and symmetric duality (see [22]). In this paper, we will introduce an approximate Mond-Weir dual model for the problem (VOP) and examine duality theorems between it and primal problem involving approximate quasi weakly e cient solution.…”