About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis
Volume 2014 (2014), Article ID 317304, 7 pages
http://dx.doi.org/10.1155/2014/317304
Research Article

On Nonsmooth Semi-Infinite Minimax Programming Problem with -Invexity

1Department of Mathematics, Hanshan Normal University, Guangdong 521041, China
2Department of Computer Science, Hanshan Normal University, Guangdong 521041, China
3Science College, Beijing University of Civil Engineering and Architecture, Beijing 102616, China

Received 29 August 2013; Accepted 12 January 2014; Published 4 March 2014

Academic Editor: Josip E. Pečarić

Copyright © 2014 X. L. Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Antczak, “Generalized fractional minimax programming with B-(p,r)-invexity,” Computers & Mathematics with Applications, vol. 56, no. 6, pp. 1505–1525, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  2. M. A. Hanson, “On sufficiency of the Kuhn-Tucker conditions,” Journal of Mathematical Analysis and Applications, vol. 80, no. 2, pp. 545–550, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. A. Ben-Israel and B. Mond, “What is invexity?” The Journal of the Australian Mathematical Society B, vol. 28, no. 1, pp. 1–9, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. T. Antczak, “(p,r)-invex sets and functions,” Journal of Mathematical Analysis and Applications, vol. 80, pp. 545–550, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. V. Preda, “On Sufficiency and duality for multiobjective programs,” Journal of Mathematical Analysis and Applications, vol. 166, no. 2, pp. 365–377, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. Z. A. Liang, H. X. Huang, and P. M. Pardalos, “Optimality conditions and duality for a class of nonlinear fractional programming problems,” Journal of Optimization Theory and Applications, vol. 110, no. 3, pp. 611–619, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. D. H. Yuan, X. L. Liu, A. Chinchuluun, and P. M. Pardalos, “Nondifferentiable minimax fractional programming problems with (C,α,ρ,d)-convexity,” Journal of Optimization Theory and Applications, vol. 129, no. 1, pp. 185–199, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  8. T. Antczak, “The notion of V-r-invexity in differentiable multiobjective programming,” Journal of Applied Analysis, vol. 11, no. 1, pp. 63–79, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  9. H. C. Lai and J. C. Lee, “On duality theorems for a nondifferentiable minimax fractional programming,” Journal of Computational and Applied Mathematics, vol. 146, no. 1, pp. 115–126, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. T. Antczak, “Minimax programming under (p,r)-invexity,” European Journal of Operational Research, vol. 158, no. 1, pp. 1–19, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  11. I. Ahmad, S. K. Gupta, N. Kailey, and R. P. Agarwal, “Duality in nondifferentiable minimax fractional programming with B-(p,r)-invexity,” Journal of Inequalities and Applications, vol. 2011, article 75, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  12. S. K. Mishra and K. Shukla, “Nonsmooth minimax programming problems with V-r-invex functions,” Optimization, vol. 59, no. 1, pp. 95–103, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  13. T. Antczak and A. Stasiak, “(Φ,ρ)-invexity in nonsmooth optimization,” Numerical Functional Analysis and Optimization, vol. 32, no. 1, pp. 1–25, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. G. Caristi, M. Ferrara, and A. Ştefănescu, “Mathematical programming with (Φ,ρ)-invexity,” in Generalized Convexity and Related Topics, V. Konnov Igor, T. L. Dinh, and M. Rubinov Alexander, Eds., vol. 583 of Lecture Notes in Economics and Mathematical Systems, pp. 167–176, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  15. M. V. Ştefănescu and A. Ştefănescu, “Minimax programming under new invexity assumptions,” Revue Roumaine de Mathématiques Pures et Appliquées, vol. 52, no. 3, pp. 367–376, 2007. View at Zentralblatt MATH · View at MathSciNet
  16. T. Antczak, “Nonsmooth minimax programming under locally Lipschitz (Φ,ρ)-invexity,” Applied Mathematics and Computation, vol. 217, no. 23, pp. 9606–9624, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  17. M. V. Ştefănescu and A. Ştefănescu, “On semi-infinite minmax programming with generalized invexity,” Optimization, vol. 61, no. 11, pp. 1307–1319, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. M. López and G. Still, “Semi-infinite programming,” European Journal of Operational Research, vol. 180, no. 2, pp. 491–518, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. A. Shapiro, “Semi-infinite programming, duality, discretization and optimality conditions,” Optimization, vol. 58, no. 2, pp. 133–161, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. C. A. Floudas and P. M. Pardalos, Encyclopedia of Optimization, Springer, New York, NY, USA, 2nd edition, 2009.
  21. F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, NY, USA, 1983. View at MathSciNet
  22. F. H. Clarke, “Generalized gradients and applications,” Transactions of the American Mathematical Society, vol. 205, pp. 247–262, 1975. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet