Skip to main content
SpringerLink
Log in

Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions

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

Abstract

In this paper, nonsmooth univex, nonsmooth quasiunivex, and nonsmooth pseudounivex functions are introduced. By utilizing these new concepts, sufficient optimality conditions for a weakly efficient solution of the nonsmooth multiobjective programming problem are established. Weak and strong duality theorems are also derived for Mond-Weir type multiobjective dual programs.

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

Access this article

Log in via an institution

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. Chinchuluun A and Pardalos P M, Mutiobjective programming problems under generalized convexity, Models and algorithms for global optimization (ed. by Torn A and Zilinskas J), Springer, Berlin, 2007, 4: 3–20.

    Article  MathSciNet  Google Scholar 

  2. Chinchuluun A, Pardalos P M, Migdalas A, and Pitsoulis L, Pareto Optimality, Game Theory, and Equilibria, Springer, 2008.

    Book  MATH  Google Scholar 

  3. Long X J and Huang N J, Lipschitz B-preinvex functions and nonsmooth multiobjective programming, Pacific J. Optim., 2011, 7: 83–95.

    MathSciNet  MATH  Google Scholar 

  4. Long X J and Peng J W, Semi-B-preinvex functions, J. Optim. Theory Appl., 2006, 131: 301–305.

    Article  MathSciNet  MATH  Google Scholar 

  5. Long X J and Quan J, Optimality conditions and duality for minimax fractional programming involving nonsmooth generalized univexity, Numer. Algebra, Control Optim., 2011, 1: 361–370.

    Article  MathSciNet  MATH  Google Scholar 

  6. Mishra S K and Giorgi G, Invexity and Optimization, Nonconvex Optimization and Its Applications, Vol. 88, Springer-verlag Berlin, Heidelberg, Germany, 2008.

    Google Scholar 

  7. Mishra S K, Wang S Y, and Lai K K, V-Invex Functions and Vector Optimization, Optimization and Its Applications, Vol. 14, Springer Science Business Media, New York, 2008.

    Google Scholar 

  8. Mishra S K, Wang S Y, and Lai K K, Generalized Convexity and Vector Optimization, Nonconvex Optimization and Its Applications, Vol. 90, Springer-verlag Berlin, Heidelberg, Germany, 2009.

    Google Scholar 

  9. Hanson M A, On sufficiency of the Kuhn-Tucker conditions, J. Math. Anal. Appl., 1981, 80: 545–550.

    Article  MathSciNet  MATH  Google Scholar 

  10. Reiland T W, Nonsmmoth invexity, Bull. Austral. Math. Soc., 1992, 41 437–446.

    MathSciNet  Google Scholar 

  11. Clarke F H, Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, 1983.

    MATH  Google Scholar 

  12. Lee G M, Nonsmooth invexity in multiobjective programming, J. Inform Optim. Sci., 1994, 15: 127–136.

    MathSciNet  MATH  Google Scholar 

  13. Ye Y L, D-invexity and optimality conditions, J. Math. Anal. Appl., 1991, 162: 242–249.

    Article  MathSciNet  MATH  Google Scholar 

  14. Antczak T, Multiobjective programming under d-invexity, European J. Oper. Res., 2002, 137: 28–36.

    Article  MathSciNet  MATH  Google Scholar 

  15. Aghezzaf B and Hachimi M, Sufficient optimality conditions and duality in multiobjective optimization involving generalized convexity, Numer. Funct. Anal. Optim., 2001, 22: 775–788.

    Article  MathSciNet  MATH  Google Scholar 

  16. Jeyakumar V and Mond B, On generalized convex mathematical programming, J. Aust. Math. Soc. Ser. B, 1992, 34: 43–53.

    Article  MathSciNet  MATH  Google Scholar 

  17. Bector C R, Suneja S K, and Gupta S, Univex functions and univex nonlinear programming, Proceedings of the Aaministrative Scinences Association of Canada, 1992, 115–124.

    Google Scholar 

  18. Mishra S K, Wang S Y, and Lai K K, Nondifferentiable multiobjective programming under generalized d-univexity, European J. Oper. Res., 2005, 160: 218–226.

    Article  MathSciNet  MATH  Google Scholar 

  19. Antczak T, An η-approximation approach in nonlinear vector optimization with univex functions, Asia-Pacific J. Oper. Res., 2006, 23: 525–542.

    Article  MathSciNet  MATH  Google Scholar 

  20. Mond B and Weir T, Generalized Concavity and Duality, Generalized Concavity in Optimization and Economics (ed. by Schaible S and Ziemba W T), Academic Press, New York, 1981, 263–279.

  21. Chandra S, Dutta J, and Lalitha C S, Regularity conditions and optimality in vector optimization, Numer. Funct. Anal. Optim., 2004, 25: 479–501.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing, 400067, China

    Xianjun Long

Authors
  1. Xianjun Long
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xianjun Long.

Additional information

This research is supported by the National Natural Science Foundation of China under Grant No. 11001287, the Natural Science Foundation Project of Chongqing (CSTC 2010BB9254), the Education Committee Project Research Foundation of Chongqing under Grant No. KJ100711.

This paper was recommended for publication by Editor WANG Shouyang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Long, X. Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions. J Syst Sci Complex 26, 1002–1018 (2013). https://doi.org/10.1007/s11424-013-1089-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-013-1089-6

Key words

Search

Navigation