Optimality Conditions and Duality for Multiobjective Programming Involving (C, α, ρ, d) type-I Functions

In this chapter, we present a unified formulation of generalized convex functions. Based on these concepts, sufficient optimality conditions for a nondifferentiable multiobjective programming problem are presented. We also introduce a general Mond-Weir type dual problem of the problem and establish weak duality theorem under generalized convexity assumptions. Strong duality result is derived using a constraint qualification for nondifferentiable multiobjective programming problems.

[1]  D. E. Ward,et al.  General constraint qualifications in nondifferentiable programming , 1990, Math. Program..

[2]  Panos M. Pardalos,et al.  Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems , 2001 .

[3]  Brahim Aghezzaf,et al.  Sufficiency and Duality in Multiobjective Programming Involving Generalized (F, ρ)-Convexity , 2001 .

[4]  W. Schmitendorf Necessary conditions and sufficient conditions for static minmax problems , 1977 .

[5]  Vasile Preda,et al.  On Sufficiency and Duality for Generalized Quasiconvex Programs , 1994 .

[6]  Jean-Philippe Vial,et al.  Strong and Weak Convexity of Sets and Functions , 1983, Math. Oper. Res..

[7]  Zhi-an Liang,et al.  Optimality conditions and duality for a minimax fractional programming with generalized convexity , 2003 .

[8]  T. Maeda Constraint qualifications in multiobjective optimization problems: Differentiable case , 1994 .

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

[10]  S. Suneja,et al.  Optimality and Duality in Nondifferentiable Multiobjective Optimization Involvingd-Type I and Related Functions , 1997 .

[11]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[12]  Brahim Aghezzaf,et al.  Sufficiency and duality in nondifferentiable multiobjective programming involving generalized type I functions , 2004 .

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

[14]  Â. J. Vial,et al.  Strong Convexity of Sets and Functions , 1982 .

[15]  R. N. Mukherjee Generalized convex duality for multiobjective fractional programs , 1991 .

[16]  Panos M. Pardalos,et al.  Generalized convexities and generalized gradients based on algebraic operations , 2006 .

[17]  Panos M. Pardalos,et al.  Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity , 2006 .

[18]  V. Preda,et al.  On Constraint Qualification in Multiobjective Optimization Problems: Semidifferentiable Case , 1999 .

[19]  D. E. Ward,et al.  Generalized properly efficient solutions of vector optimization problems , 2001, Math. Methods Oper. Res..

[20]  Panos M. Pardalos,et al.  Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity , 2007, Ann. Oper. Res..

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

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

[23]  Panos M. Pardalos,et al.  Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems , 2003, J. Glob. Optim..

[24]  A. A. K. Majumdar,et al.  Optimality Conditions in Differentiable Multiobjective Programming , 1997 .

[25]  M. A. Hanson,et al.  Optimality criteria in mathematical programming involving generalized invexity , 1988 .

[26]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[27]  M. A. Hanson,et al.  Necessary and sufficient conditions in constrained optimization , 1987, Math. Program..

[28]  Surjeet Kaur,et al.  Optimality Criteria in Nonlinear Programming Involving Nonconvex Functions , 1985 .

[29]  A. Mehra,et al.  Optimality Conditions and Duality Involving Arcwise Connected and Generalized Arcwise Connected Functions , 1999 .

[30]  C. R. Bector Duality in nonlinear fractional programming , 1973, Z. Oper. Research.