Advertisement
Published in:
2011 | OriginalPaper | Chapter
On Efficiency in Nondifferentiable Multiobjective Optimization Involving Pseudo d-Univex Functions; Duality
Authors : J. S. Rautela, Vinay Singh
Published in: Topics in Nonconvex Optimization
Publisher: Springer New York
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this chapter we introduce the concepts of KT-pseudo
d
-univex-I, KT-pseudo
d
-univex-II, and FJ-pseudo
d
-univex-II functions. The main objective of introducing these functions is to establish characterizations for efficient solutions to nondifferentiable multiobjective programming problems. Moreover, characterizations for efficient solutions by Fritz—John optimality conditions are also obtained. Furthermore, the Mond—Weir type dual problem is studied and weak, strong, and converse duality results are established involving the aforementioned class of functions.