Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative

HTML  Download Download as PDF (Size: 138KB)  PP. 452-460  
DOI: 10.4236/am.2011.24057    7,640 Downloads   12,019 Views  Citations
Author(s)

Affiliation(s)

.

ABSTRACT

In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficient under the generalised dI-univexity requirements. Moreover, weak, strong and strict converse duality theorems are also derived for Mond-Weir type dual programs.

Share and Cite:

I. Ahmad, "Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative," Applied Mathematics, Vol. 2 No. 4, 2011, pp. 452-460. doi: 10.4236/am.2011.24057.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.