On G-invexity-type nonlinear programming problems

On G-invexity-type nonlinear programming problems

In this paper, we introduce the concepts of KT -G-invexity and W D-G-invexity for theconsidered differentiable optimization problem with inequality constraints. Using KT -G-invexity notion, we prove new necessary and sufficient optimality conditions for a new class of such nonconvexdifferentiable optimization problems. Further, the so-called G-Wolfe dual problem is defined for theconsidered extremum problem with inequality constraints. Under W D-G-invexity assumption, thenecessary and sufficient conditions for weak duality between the primal optimization problem and itsG-Wolfe dual problem are also established.

___

  • [1] Antczak, T., (p, r)-invex sets and functions, Journal of Mathematical Analysis and Applications, 263, 355-379 (2001).
  • [2] Antczak, T., A class of B-(p, r)-invex functions and mathematical programming, Journal of Mathematical Analysis and Applications, 286, 187-206 (2003).
  • [3] Antczak, T., r-pre-invexity and r-invexity in mathematical programming, Computers and Mathematics with Applications, 50, 551-566 (2005).
  • [4] Antczak, T., New optimality conditions and duality results of G-type in differentiable mathematical programming, Nonlinear Analysis, Theory, Methods and Applications, 66, 1617-1632 (2007).
  • [5] Arana Jim´enez, M., Ruiz, G. and Rufian, A. eds., Optimality conditions in vector optimization. Bussum: Bentham Science Publishers, Ltd., (2010).
  • [6] Ben-Israel, A and Mond, B , What is invexity?, Journal of Australian Mathematical Society Ser.B, 28, 1-9 (1986).
  • [7] Bector, C.R. , Chandra, S., Gupta, S., and Suneja, S.K., Univex sets, functions and univex nonlinear programming, In: Komlosi, S., Rapcsak, T. and Schaible, S., eds. Proceedings of Conference of Generalized Convexity, Pecs, Hungary: Springer Verlag, 1-11 (1993).
  • [8] Bector, C.R. and Singh, C., B-vex functions, Journal of Optimization Theory and Applications, 71, 237-253 (1991).
  • [9] Caprari, E., ?-invex functions and (F, ?)- convex functions: properties and equivalences, Optimization, 52, 65-74 (2003).
  • [10] Craven, B.D., Invex functions and constrained local minima, Bulletin of the Australian Mathematical Society, 24, 357-366 (1981).
  • [11] Hanson, M.A., On sufficiency of the KuhnTucker conditions, Journal of Mathematical Analysis and Applications, 80, 545-550 (1981).
  • [12] Hanson, M.A. and Mond, B., Further generalizations of convexity in mathematical programming, Journal of Information and Optimization Sciences, 3, 25-32 (1982).
  • [13] Jeyakumar, V., Equivalence of saddle-points and optima, and duality for a class of nonsmooth non-convex problems, Journal of Mathematical Analysis and Applications, 130, 334-343 (1988)
  • [14] Martin, D.H., The essence of invexity, Journal of Optimization, Theory and Applications, 47, 65-75 (1985).
  • [15] Suneja, S.K., Singh, C. and Bector, C.R., Generalizations of pre-invex functions and Bvex functions, Journal of Optimization Theory and Applications, 76, 577-587 (1993).
  • [16] Weir, T. and Jeyakumar, V., A class of nonconvex functions and mathematical programming, Bulletin of the Australian Mathematical Society, 38, 177-189 (1988)