Multiobjective programming under d-invexity
In this paper, a generalization of convexity is considered in the case of nonlinear multiobjective programming problem where the functions involved are nondifferentiable. By considering the concept of Pareto optimal solution and substituting d-invexity for convexity, the Fritz John type and KarushKuhnTucker type necessary optimality conditions and duality in the sense of MondWeir and Wolfe for nondifferentiable multiobjective programming are given.
multiobjective programming optimality conditions duality (weak) pareto optimal solution d-invex function with respect to ?