Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized (F, α, ρ, θ)-d-V-univex functions

[1]  M. A. Hanson.  On sufficiency of the Kuhn-Tucker conditions , 1981 .

[2]  M. A. Hanson,et al.  Further Generalizations of Convexity in Mathematical Programming , 1982 .

[3]  V. Jeyakumar.  Equivalence of saddle-points and optima, and duality for a class of non-smooth non-convex problems , 1988 .

[4]  B. Mond,et al.  Pre-invex functions in multiple objective optimization , 1988 .

[5]  Vasile Preda,et al.  On efficiency and duality for multiobjective programs , 1992 .

[6]  Vaithilingam Jeyakumar,et al.  On generalised convex mathematical programming , 1992, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[7]  P. Jain,et al.  Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs , 1994 .

[8]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[9]  I. Ahmad.  Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity , 2005 .

[10]  T. R. Gulati,et al.  Sufficiency and duality in nonsmooth multiobjective optimization involving generalized (F, alpha, pi, d)-Type I functions , 2006, Comput. Math. Appl..

[11]  XJ Zheng,et al.  Minimax fractional programming under nonsmooth generalized (F,ρ,θ)-d-univexity , 2007 .

[12]  Izhar Ahmad,et al.  Sufficiency and Duality in Multiobjective Programming under Generalized Type I Functions , 2007 .

[13]  Xiaojin Zheng,et al.  Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems , 2010, Int. J. Comput. Math..

[14]  Izhar Ahmad,et al.  On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized V , 2011 .