Skip to main content
Log in

Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized (C, α, ρ, d)-convexity

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized (C, α, ρ, d)-convex functions. The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semi-infinite programming problem and establish weak, strong and strict converse duality theorems relating the primal and the dual problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Goberna M A and Lopez M A, Linear Semi-Infinite Optimization, Wiley, 1998.

    Google Scholar 

  2. Goberna M A and Lopez M A, Semi-Infinite Programming-Recent Advances, Kluwer, 2001.

    Google Scholar 

  3. Hettich R and Kortanek K O, Semi-infinite programming: Theory, methods and applications, SIAM Rev., 1993, 35: 380–429.

    Article  MATH  MathSciNet  Google Scholar 

  4. Lopez M and Still G, Semi-infinite programming, Eur. J. Oper. Res., 2007, 180: 491–518.

    Article  MATH  MathSciNet  Google Scholar 

  5. Shapiro A, Semi-infinite programming, duality, discretization and optimality condition, Optim., 2009, 58(2): 133–161.

    Article  MATH  Google Scholar 

  6. Gunzel H, Jongen H Th, and Stein O, Generalized semi-infinite programming: On generic local minimizers, J. Global Otim., 2008, 42(3): 413–421.

    Article  MathSciNet  Google Scholar 

  7. Gustafson S A, Semi-infinite programming: Approximation methods, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  8. Gustafson S A, Semi-infinite programming: Methods for linear problems, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  9. Hettich R, Kaplan A, and Tichatschke R, Semi-infinite programming: Numerical methods, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  10. Hettich R and Still G, Semi-infinite programming: Second order optimality conditions, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  11. Jongen H T and Stein O, Smoothing methods for semi-infinite optimization, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  12. Kortanek K O and Medvedev V G, Semi-infinite programming and applications in finance, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  13. Levitin E and Tichatschke R, A branch-and-bound approach for solving a class of generalized semi-infinite programming problems, J. Global Optim., 1998, 13(3): 299–315.

    Article  MATH  MathSciNet  Google Scholar 

  14. Li D H, Liqun Q, Tam J, and Wu S Y, A smoothing Newton method for semi-infinite programming, J. Global Optim., 2004, 30: 169–194.

    Article  MATH  MathSciNet  Google Scholar 

  15. Liu G X, A homotopy interior point method for semi-infinite programming problems, J. Global Optim., 2007, 37(4): 631–646.

    Article  MATH  MathSciNet  Google Scholar 

  16. Reemtsen R, Semi-infinite programming: Discretization methods, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  17. Rubio J E, Semi-infinite programming and control problems, Encyclopedia of Optimization (ed. by Floudas C A and Pardalos P M), Springer, 2009.

    Google Scholar 

  18. Yuan D H, Chinchuluun A, Liu X L, and Pardalos P M, Generalized convexities and generalized gradients based on algebraic operations, J. Math. Anal. Appl., 2006, 321: 675–690.

    Article  MATH  MathSciNet  Google Scholar 

  19. Mishra S K and Upadhyay B B, Nonsmooth minimax fractional programming involving η pseudilinear functions, Optim., DOI:10.1080/02331934.2012.689833.

  20. Canovas M J, Lopez M A, Mordukhovich B S, and Parra J, Variational analysis in semi-infinite and infinite programming, I: Stability of linear inequality systems of feasible solutions, SIAM J. Optim., 2009, 20: 1504–1526.

    Article  MATH  MathSciNet  Google Scholar 

  21. Canovas M J, Lopez M A, Mordukhovich B S, and Parra J, Variational analysis in semi-infinite and infinite programming, II: Necessary optimality conditions, SIAM J. Optim., 2010, 20: 2788–2806.

    Article  MATH  MathSciNet  Google Scholar 

  22. Kanzi N and Nobakhtian S, Optimality conditions for non-smooth semi-infinite programming, Optim., 2010, 59: 717–727.

    Article  MATH  MathSciNet  Google Scholar 

  23. Mishra S K, Jaiswal M, and Hoai An L T, Duality for nonsmooth semi-infinite programming problems, Optim. Lett., 2012, 6: 261–271.

    Article  MATH  MathSciNet  Google Scholar 

  24. Preda V, On efficiency and duality for multiobjective programs, J. Math. Anal. Appl., 1992, 166: 365–377.

    Article  MATH  MathSciNet  Google Scholar 

  25. Hanson M A and Mond B, Further generalizations of convexity in mathematical programming, J. Inform. Optim. Sci., 1986, 3: 25–32.

    MathSciNet  Google Scholar 

  26. Vial J P, Strong and weak convexity set and functions, Math. Oper. Res., 1983, 8: 231–259.

    Article  MATH  MathSciNet  Google Scholar 

  27. Nobakhtian S, Sufficiency in nonsmooth multiobjective programming involving generalized (F, ρ)-Convexity, J. Optim. Theory Appl., 2006, 130: 359–365.

    Article  MATH  MathSciNet  Google Scholar 

  28. Nobakhtian S, Generalized (F, ρ)-convexity and duality in nonsmooth problems of multiobjective optimization, J. Optim. Theory Appl., 2008, 136: 61–68.

    Article  MATH  MathSciNet  Google Scholar 

  29. Liang Z A, Huang H X, and Pardalos P M, Optimality conditions and duality for a class of nonlinear fractional programming problems, J. Optim. Theory Appl., 2001, 110: 611–619.

    Article  MATH  MathSciNet  Google Scholar 

  30. Yuan D H, Liu X L, Chinchuluun A, and Pardalos P M, Nondifferentiable minimax fractional programming problems, J. Optim. Theory Appl., 2006, 129(1): 185–199.

    Article  MATH  MathSciNet  Google Scholar 

  31. Chinchuluun A and Pardalos P M, Multiobjective programming problems under generalized convexity, Models and Algorithms for Global Optimization, Optimization and Its Application, 2007, 4(1): 3–20.

    Article  MathSciNet  Google Scholar 

  32. Yuan D H, Chinchuluun A, Liu X L, and Pardalos P M, Yuan D H, Chinchuluun A, Liu X L, and Pardalos P M, Optimality conditions and duality for multiobjective programming involving (C, α, ρ, d) type-I functions, Lecture Notes in Econom. and Math. Systems, Springer, Berlin, 2007, 73–87.

    Google Scholar 

  33. Clarke F H, Optimization and Nonsmooth Analysis, John Wiely Sons Inc., 1983.

    MATH  Google Scholar 

  34. Antczak T and Kisiel K, Strict minimizers of order m in nonsmooth optimization problems, Comment. Math. Univ. Carolin., 2006, 47: 213–232.

    MATH  MathSciNet  Google Scholar 

  35. Mond B and Weir T, Generalized concavity and duality, Generalized Concavity in Optimization and Economics, Academic Press, New York, 1981.

    Google Scholar 

  36. Jourani A, Constraint qulalification and Lagrange multipliers in nondifferentiable programming problems, J. Optim. Theory Appl., 1994, 81: 533–548.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shashi Kant Mishra.

Additional information

This paper was recommended for publication by Editor DAI Yuhong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mishra, S.K., Jaiswal, M. & Hoai An, L.T. Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized (C, α, ρ, d)-convexity. J Syst Sci Complex 28, 47–59 (2015). https://doi.org/10.1007/s11424-015-2233-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-015-2233-2

Keywords

Navigation