Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions

In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some duality results.

[1]  Sudha Gupta,et al.  Duality in multiobjective nonlinear programming involving semilocally convex and related functions , 1998, Eur. J. Oper. Res..

[2]  Morgan A. Hanson.  A Generalization of the Kuhn-Tucker Sufficiency Conditions , 1994 .

[3]  R. N. Mukherjee,et al.  On generalised convex multi-objective nonsmooth programming , 1996, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[4]  On Duality Theorems for Nonsmooth Lipschitz Optimization Problems , 2001 .

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

[6]  Kin Keung Lai,et al.  Optimality and Duality in Nondifferentiable and Multiobjective Programming under Generalized d-Invexity , 2004, J. Glob. Optim..

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

[8]  P. Wolfe.  A duality theorem for non-linear programming , 1961 .

[9]  Vasile Preda,et al.  Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions , 2003 .

[10]  Fritz-John Optimality and Duality for Non-convex Programs , 1997 .

[11]  Adi Ben-Israel,et al.  What is invexity? , 1986, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[12]  Tetsuzo Tanino,et al.  Optimality and Duality for Nonsmooth Multiobjective Fractional Programming with Generalized Invexity , 2001 .

[13]  B. Craven.  Invex functions and constrained local minima , 1981, Bulletin of the Australian Mathematical Society.

[14]  K. Elster,et al.  Abstract cone approximations and generalized differentiability in nonsmooth optimization , 1988 .

[15]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[16]  Do Sang Kim,et al.  Optimality and Duality for Invex Nonsmooth Multiobjective programming problems , 2004 .

[17]  Tadeusz Antczak.  Multiobjective programming under d-invexity , 2002, Eur. J. Oper. Res..

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

[19]  K. K. Lai,et al.  Nondifferentiable multiobjective programming under generalized d , 2005, Eur. J. Oper. Res..

[20]  M. Castellani.  Nonsmooth Invex Functions and Sufficient Optimality Conditions , 2001 .

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

[22]  S. Sinha.  A Duality Theorem for Nonlinear Programming , 1966 .

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

[24]  J. C. Liu.  Optimality and Duality for Generalized Fractional Programming Involving Nonsmooth Pseudoinvex Functions , 1996 .

[25]  Yu. S. Ledyaev,et al.  Nonsmooth analysis and control theory , 1998 .