S. K. Mishra, S. Y. Wang and K. K. Lai, “Nondifferentiable Multiobjective Programming under Generalized -Univexity,” European Journal of Operational Research, Vol. 160, No. 1, 2005, pp. 218-226. doi:10.1016/S0377-2217(03)00439-9

has been cited by the following article:

• TITLE: Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative

  AUTHORS: Izhar Ahmad

  KEYWORDS: Multiobjective Programming, Nondifferentiable Programming, Generalized dI-Univexity, Sufficiency, Duality

  JOURNAL NAME: Applied Mathematics, Vol.2 No.4, March 31, 2011

  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.