Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints

References

• M. Adán and V. Novo, Duality and saddle-points for convex-like vector optimization problems on real linear spaces, Top 13 (2005), pp. 343–357. doi: 10.1007/BF02579060
   Google Scholar
• T. Antczak, New approach to multiobjective programming with a modified objective function, J. Global Optim. 27 (2003), pp. 485–495. doi: 10.1023/A:1026080604790
   Web of Science ®Google Scholar
• T. Antczak, r-pre-invexity and r-invexity in mathematical programming, Comput. Math. Appl. 50 (2005), pp. 551–566. doi: 10.1016/j.camwa.2005.01.024
   Web of Science ®Google Scholar
• T. Antczak, Saddle point criteria and duality in multiobjective programming via an η-approximation method, ANZIAM J. 47 (2005), pp. 155–172. doi: 10.1017/S1446181100009962
   Web of Science ®Google Scholar
• T. Antczak, New saddle points criteria in multiobjective programming with G-invex functions via an η -approximation method, Int. J. Optim. Theory, Methods Appl. 1 (2009), pp. 140–154.
   Google Scholar
• T. Antczak, Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity, J. Global Optim. 45 (2009), pp. 319–334. doi: 10.1007/s10898-008-9377-8
   Google Scholar
• T. Antczak, Saddle points criteria via a second order η -approximation approach for nonlinear mathematical programming involving second order invex functions, Kybernetika 47 (2011), pp. 222–240.
   Web of Science ®Google Scholar
• T. Antczak, Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under (Φ, ρ)-invexity, Nonlinear Anal. 75 (2012), pp. 3107–3121. doi: 10.1016/j.na.2011.12.009
   Web of Science ®Google Scholar
• T. Antczak and A. Stasiak, (Φ, ρ) -invexity in nonsmooth optimization, Numer. Funct. Anal. Optim. 32 (2011), pp. 1–25. doi: 10.1080/01630563.2010.526408
   Web of Science ®Google Scholar
• C.R. Bector, M.K. Betcor, A. Gill, and C. Singh, Duality for vector valued B-invex programming, in Generalized Convexity, S. Komolosi, T. Rapcsák, and S. Schaible, eds., Lecture Notes in Economics and Mathematical Systems, Vol. 405, Springer, Berlin, 1994, pp. 358–373. doi: 10.1007/978-3-642-46802-5_27
   Google Scholar
• A. Ben-Israel and B. Mond, What is invexity? J Aust. Math. Soc. 28 (1986), pp. 1–9.
   Web of Science ®Google Scholar
• G. Bhatia, Optimality and mixed saddle point criteria in multiobjective optimization, J. Math. Anal. Appl. 342 (2008), pp. 135–145. doi: 10.1016/j.jmaa.2007.11.042
   Web of Science ®Google Scholar
• D. Bhatia and P. Jain, Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs, Optimization 31 (1994), pp. 153–164. doi: 10.1080/02331939408844012
   Google Scholar
• G. Bigi, Saddlepoint optimality criteria in vector optimization, in Optimization in Economics, Finance and Industry, Proceedings of the workshop held in Verona, June 14/15th 2001, G.P. Crespi, G. Giorgi, A. Guerraggio, D. La Torre, E. Miglierina, and M. Rocca eds., Datanova, Milano, 2002, pp. 85–102.
   Google Scholar
• S.L. Chen, N.J. Huang, and M.M. Wong, B-Semipreinvex functions and vector optimization problems in Banach spaces, Taiwanese J. Math. 11 (2007), pp. 595–609.
   Web of Science ®Google Scholar
• F.H. Clarke, Nonsmooth Optimization, A Wiley-Interscience Publication, John Wiley&Sons, Inc., 1983.
   Google Scholar
• B.D. Craven, Quasimin and quasisaddlepoint for vector optimization, Numer. Funct. Anal. Optim. 11 (1990), pp. 45–54. doi: 10.1080/01630569008816360
   Web of Science ®Google Scholar
• J.Y. Fu and Y.H. Wang, Arcwise connected cone-convex functions and mathematical programming, J. Optim. Theory Appl. 118 (2003), pp. 339–352. doi: 10.1023/A:1025451422581
   Web of Science ®Google Scholar
• Giorgi, G., and A. Guerraggio, The notion of invexity in vector optimization: Smooth and nonsmooth case, in Generalized Monotonicity: Recent Results, J.P. Crouzeix, J.E. Martinez-Legaz, and M. Volle, eds., Kluwer Academic Publishers, Dordrecht, Holland, 1998, pp.389–405.
   Google Scholar
• M.A. Hanson, On sufficiency of the Kuhn–Tucker conditions, J. Math. Anal. Appl. 80 (1981), pp. 545–550. doi: 10.1016/0022-247X(81)90123-2
   Web of Science ®Google Scholar
• M.A. Hanson and B. Mond, Further generalization of convexity in mathematical programming, J. Inf. Optim. Sci. 3 (1982), pp. 25–32.
   Google Scholar
• V. Jeyakumar, Equivalence of saddle-points and optima, and duality for a class of nonsmooth non-convex problems, J. Math. Anal. Appl. 130 (1988), pp. 334–343. doi: 10.1016/0022-247X(88)90309-5
   Web of Science ®Google Scholar
• V. Jeyakumar and B. Mond, On generalized convex mathematical programming, J. Aust. Math. Soc. Ser. B 34 (1992), 43–53. doi: 10.1017/S0334270000007372
   Google Scholar
• J. Jiang and S. Xu, Optimality and saddle point for vector optimization under semilocally B-preinvex, International Conference on Artificial Intelligence and Computational Intelligence, Sanya, China, October 23–24, 2010, pp. 382–386.
   Google Scholar
• D.S. Kim and S. Schaible, Optimality and duality for invex nonsmooth multiobjective programming problems, Optimization 53 (2004), pp. 165–176. doi: 10.1080/0233193042000209435
   Web of Science ®Google Scholar
• H. Kuk, G.M. Lee, and D.S. Kim, Nonsmooth multiobjective programs with V-ρ-invexity, Indian J. Pure Appl. Math. 29 (1998), pp. 405–412.
   Web of Science ®Google Scholar
• G.M. Lee, Nonsmooth invexity in multiobjective programming, J. Inf. Optim. Sci. 15 (1994), pp. 127–136.
   Google Scholar
• Z.F. Li and S.Y. Wang, Lagrange multipliers and saddle points in multiobjective programming, J. Optim. Theory Appl. 83 (1994), pp. 63–81. doi: 10.1007/BF02191762
   Web of Science ®Google Scholar
• X.F. Li, J.L. Dong, and Q.H. Liu, Lipschitz B-vex functions and nonsmooth programming, J. Optim. Theory Appl. 93 (1997), pp. 557–574. doi: 10.1023/A:1022643129733
   Web of Science ®Google Scholar
• S.K. Mishra, On multiple-objective optimization with generalized univexity, J. Math. Anal. Appl. 224 (1998), pp. 131–148. doi: 10.1006/jmaa.1998.5992
   Web of Science ®Google Scholar
• S.K. Mishra and R.N. Mukherjee, Generalized convex composite multiobjective nonsmooth programming and conditional proper efficiency, Optimization 34 (1995), pp. 53–66. doi: 10.1080/02331939508844093
   Google Scholar
• V. Preda, On efficiency and duality for multiobjective programs, J. Math. Anal. Appl. 166 (1992), pp. 365–377. doi: 10.1016/0022-247X(92)90303-U
   Web of Science ®Google Scholar
• T.W. Reiland, Generalized invexity for nonsmooth vector-valued mappings, Numer. Funct. Anal. Optim. 10 (1989), pp. 1191–1202. doi: 10.1080/01630568908816352
   Web of Science ®Google Scholar
• M. van Rooyen, X. Zhou, and S. Zlobec, A saddle-point characterization of Pareto optima, Math. Program Ser A and B 67 (1994), pp. 77–88. doi: 10.1007/BF01582213
   Web of Science ®Google Scholar
• T. Tanaka, A characterization of generalized saddle points for vector-valued functions via scalarization, Nihonkai Math. J. 1 (1990), pp. 209–227.
   Google Scholar
• T. Tanino, Saddle points and duality in multi-objective programming, Int. J. Syst. Sci. 13 (1982), pp. 323–335. doi: 10.1080/00207728208926352
   Web of Science ®Google Scholar
• T. Tanino and Y. Sarawagi, Duality theory in multiobjective programming, J. Optim. Theory Appl. 27 (1979), pp. 509–529. doi: 10.1007/BF00933437
   Web of Science ®Google Scholar
• I. Vályi, Approximate saddle-point theorems in vector optimization, J. Optim. Theory Appl. 55 (1987), pp. 435–448. doi: 10.1007/BF00941179
   Web of Science ®Google Scholar
• G. Varalakshmi, P. Chandrakala, and P.R.S. Reddy, Weak vector saddle point theorem under V-ρ -invexity, Bull. Pure Appl. Sci. – Math. 29 (2010), pp. 453–465.
   Google Scholar
• J.P. Vial, Strong and weak convexity of sets and functions, Math. Oper. Res. 8 (1983), pp. 231–259. doi: 10.1287/moor.8.2.231
   Web of Science ®Google Scholar
• T. Weir and V. Jeyakumar, A class of nonconvex functions and mathematical programming, Bull. Aust. Math. Soc. 38 (1988), pp. 177–189. doi: 10.1017/S0004972700027441
   Web of Science ®Google Scholar
• D.J. White, Vector maximisation and Lagrange multipliers, Math. Program. 31 (1985), pp. 192–205. doi: 10.1007/BF02591748
   Web of Science ®Google Scholar
• Z. Yan and S. Li, Saddle point and generalized convex duality for multiobjective programming, J. Appl. Math. Comput. 15 (2004), pp. 227–235. doi: 10.1007/BF02935757
   Google Scholar
• Y.L. Ye, d-invexity and optimality conditions, J. Math. Anal. Appl. 162 (1991), pp. 242–249. doi: 10.1016/0022-247X(91)90190-B
   Web of Science ®Google Scholar