efficiency and duality in nondifferentiable multiobjective programming involving directional derivative效率和对偶nondifferentiable多目标规划涉及方向导数.pdfVIP

Applied Mathematics, 2011, 2, 452-460 doi:10.4236/am.2011.24057 Published Online April 2011 (http://www.SciRP.org/journal/am) Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative Izhar Ahmad Department of Mathematics and Statistics , King Fahd University of Petroleum and Minerals, Saudi Arabia, India E-mail : izharmaths@; drizhar@.sa Received December 24, 2010; revised February 24, 2011; accepted February 26, 2011 Abstract In this paper, we introduce a new class of generalized d -univexity in which each component of the objective I and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiob- jective 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 re- quirements. Moreover, weak, strong and strict converse duality theorems are also derived for Mond-Weir type dual programs. Keywords: Multiobjective Programming, Nondifferentiable Programming, Generalized d -Univexity, I Sufficiency, Duality 1. Introduction and Srivastava [9] introduced generalized d-type I func- tions in terms of directional derivative for a multiobjec- The field of multiobjective programming, also known as tive programming problem and discussed W