On G-invex multiobjective programming. Part II. Duality

This paper represents the second part of a study concerning the so-called G-multiobjective programming. A new approach to duality in differentiable vector optimization problems is presented. The techniques used are based on the results established in the paper: On G-invex multiobjective programming. Part I. Optimality by T.Antczak. In this work, we use a generalization of convexity, namely G-invexity, to prove new duality results for nonlinear differentiable multiobjective programming problems. For such vector optimization problems, a number of new vector duality problems is introduced. The so-called G-Mond–Weir, G-Wolfe and G-mixed dual vector problems to the primal one are defined. Furthermore, various so-called G-duality theorems are proved between the considered differentiable multiobjective programming problem and its nonconvex vector G-dual problems. Some previous duality results for differentiable multiobjective programming problems turn out to be special cases of the results described in the paper.

[1]  Vaithilingam Jeyakumar,et al.  A class of nonconvex functions and mathematical programming , 1988, Bulletin of the Australian Mathematical Society.

[2]  Tadeusz Antczak.  On G-invex multiobjective programming. Part I. Optimality , 2009, J. Glob. Optim..

[3]  R. Kaul,et al.  Optimality criteria and duality in multiple-objective optimization involving generalized invexity , 1994 .

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

[5]  D. T. Luc,et al.  On duality theory in multiobjective programming , 1984 .

[6]  Richard R Egudo,et al.  Efficiency and generalized convex duality for multiobjective programs , 1989 .

[7]  G. Giorgi,et al.  The Notion of Invexity in Vector Optimization: Smooth and Nonsmooth Case , 1998 .

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

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

[10]  Tadeusz Antczak.  (p, r)-Invexity in multiobjective programming , 2004, Eur. J. Oper. Res..

[11]  J. Lin.  Maximal vectors and multi-objective optimization , 1976 .

[12]  C. Singh,et al.  Optimality conditions in multiobjective differentiable programming , 1987 .

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

[14]  T. Weir,et al.  On duality for weakly minimized vector valued optimization problems , 1986 .

[15]  T. Weir,et al.  Generalised convexity and duality in multiple objective programming , 1989, Bulletin of the Australian Mathematical Society.

[16]  Shelby Brumelle,et al.  Duality for Multiple Objective Convex Programs , 1981, Math. Oper. Res..

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

[18]  M. A. Hanson,et al.  Multiobjective duality with invexity , 1987 .

[19]  C. R. Bector,et al.  Duality for vector valued B-invex programming , 1994 .

[20]  T. Weir,et al.  Proper efficiency and duality for vector valued optimization problems , 1987, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[21]  W. Ziemba,et al.  Generalized concavity in optimization and economics , 1981 .

[22]  T. Antczak.  The Notion of V-r-Invexity in Differentiable Multiobjective Programming , 2005 .

[23]  B. M. Glover,et al.  Invex functions and duality , 1985, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

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

[25]  Y. Sawaragi,et al.  Duality theory in multiobjective programming , 1979 .

[26]  Johannes Jahn,et al.  Duality in vector optimization , 1983, Math. Program..

[27]  Tadeusz Antczak.  New optimality conditions and duality results of G type in differentiable mathematical programming , 2007 .