Nondifferentiable multiobjective programming under generalized d-univexity

Nondifferentiable multiobjective programming under generalized d-univexity

0.00 Avg rating0 Votes
Article ID: iaor20053317
Country: Netherlands
Volume: 160
Issue: 1
Start Page Number: 218
End Page Number: 226
Publication Date: Jan 2005
Journal: European Journal of Operational Research
Authors: , ,
Keywords: duality
Abstract:

In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi, d-invex functions in Antczak and univex functions in Bector et al. By utilizing the new concepts, we derive a Karush–Kuhn–Tucker sufficient optimality condition and establish Mond–Weir type and general Mond–Weir type duality results for the nondifferentiable multiobjective programming problem.

Reviews

Required fields are marked *. Your email address will not be published.