Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized [formula omitted]-univex functions

Abstract

In this paper, we introduce a new class of generalized ( F , α , ρ , θ ) – d – V -univex functions for a nonsmooth multiobjective programming problem. Sufficient optimality conditions under generalized ( F , α , ρ , θ ) – d – V -univex functions are established for a feasible solution to be an efficient solution. Appropriate duality theorems for a Mond–Weir-type dual are also presented under the aforesaid assumptions.