Skip to main content
SpringerLink
Log in

Optimality of E-pseudoconvex multi-objective programming problems without constraint qualifications

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this note, we consider the optimality criteria of multi-objective programming problems without constraint qualifications involving generalized convexity. Under the E-pseudoconvexity assumptions, the unified necessary and sufficient optimality conditions are established for weakly efficient and efficient solutions, respectively, in multi-objective programming problems.

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. Chen X.: Some properties of semi-E-convex functions. J. Math. Anal. Appl. 275, 251–262 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chinchuluun A., Pardalos P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154(1), 29–50 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Duca D.I., Lupsa L.L.: On the E-epigraph of an E-convex functions. J. Optim. Theory Appl. 129(2), 341–348 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fulga C., Preda V.: Nonlinear programming with E-preinvex and local E-preinvex functions. Eur. J. Oper. Res. 192, 737–743 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Luo J.: Some properties of E-pseudoconvex functions and the applications in mathematical programming. J. Congqing Technol. Business Univ. 25(5), 449–453 (2008) (in Chinese)

    Google Scholar 

  6. Jian J.B.: Incorrect result for E-convex functions and E-convex programming. Math. Res. Expo. 23(3), 461–466 (2003)

    MathSciNet  MATH  Google Scholar 

  7. Pardalos P.M., Siskos Y., Zopounidis C.: Advances in Multicriteria Analysis. Kluwer, Dordrecht (1995)

    MATH  Google Scholar 

  8. Syaua Y.R., Lee S.: Some properties of E-convex functions. Appl. Math. Lett. 18, 1074–1080 (2005)

    Article  MathSciNet  Google Scholar 

  9. Syaua Y.R., Jia L., Lee S.: Generalizations of E-convex and B-vex functions. Comput. Math. Appl. 58(4), 711–716 (2009)

    Article  MathSciNet  Google Scholar 

  10. Yang X.M.: On E-convex set, E-convex functions, and E-convex programming. J. Optim. Theory Appl. 109(3), 699–704 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Youness E.A.: E-convex set, E-convex functions, and E-convex programming. J. Optim. Theory Appl. 102(2), 439–450 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Youness E.A.: Optimality criteria in E-convex programming[J]. Chaos Solitons Fractals 12, 1737–1745 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Youness E.A.: Quasi and strictly quasi E-convex functions. Stat. Manag. Syst. 4, 201–210 (2001)

    MathSciNet  MATH  Google Scholar 

  14. Youness E.A.: Characterization of efficient solutions of multi-objective E-convex programming problems. Appl. Math. Comput. 151, 755–761 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Youness E.A., Emam T.: Semi strongly E-convex functions. J. Math. Stat. 1(1), 51–57 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Youness E.A., Emam T.: Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semei-strong E-convexity. Acta Mathematica Scientia B 28(1), 7–16 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Yu, G., Jiang, Y.: Saddle points optimality criteria and duality for multi-objective E-convex programming problems. Int. J. Optim Theory Methods Appl. (2010, in press)

  18. Zopounidis C., Pardalos P.M.: Handbook of Multicriteria Analysis Series: Applied Optimization, vol. 103. Springer, Berlin (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute of Information and System Computation Science, Beifang University of Nationalities, Yinchuan, 750021, People’s Republic of China

    GuoLin Yu, Yangyang Lu & Yan Jiang

Authors
  1. GuoLin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yangyang Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to GuoLin Yu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, G., Lu, Y. & Jiang, Y. Optimality of E-pseudoconvex multi-objective programming problems without constraint qualifications. Optim Lett 6, 1603–1611 (2012). https://doi.org/10.1007/s11590-011-0350-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0350-y

Keywords

Search

Navigation