Skip to main content
SpringerLink
Log in

Scalarizations for Approximate Quasi Efficient Solutions in Multiobjective Optimization Problems

  • Published:
Journal of the Operations Research Society of China Aims and scope Submit manuscript

Abstract

In this paper, by reviewing two standard scalarization techniques, a new necessary and sufficient condition for characterizing \((\varepsilon ,\bar{\varepsilon })\)-quasi (weakly) efficient solutions of multiobjective optimization problems is presented. The proposed procedure for the computation of \((\varepsilon ,\bar{\varepsilon })\)-quasi efficient solutions is given. Note that all of the provided results are established without any convexity assumptions on the problem under consideration. And our results extend several corresponding results in multiobjective optimization.

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

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Amahroq, T., Taa, A.: On Lagrange Kuhn–Tucker multipliers for multiobjective optimization problems. Optimization 41, 159–172 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beldiman, M., Panaitescu, E., Dogaru, L.: Approximate quasi efficient solutions in multiobjective optimization. Bull. Math. Soc. Sci. Math. Roum. 99, 109–121 (2008)

    MathSciNet  Google Scholar 

  3. Bolintineanu, S.: Vector variational principles: \(\varepsilon \)-efficiency and scalar stationarity. J. Convex Anal. 8, 71–85 (2001)

  4. Chen, G.Y., Huang, X.X., Hou, S.H.: General Ekeland’s variational principle for set-valued mappings. J. Optim. Theory Appl. 106, 151–164 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ciligot-Travain, M.: On Lagrange Kuhn–Tucker multipliers for Pareto optimization problems. Numer. Funct. Anal. Optim. 15, 689–693 (1994)

    Article  MathSciNet  Google Scholar 

  6. Durea, M., Dutta, J., Tammer, C.: Lagrange multipliers for \(\varepsilon \)-pareto solutions in vector optimization with nonsolid cones in Banach spaces. J. Optim. Theory Appl. 145, 196–211 (2010)

  7. Dutta, J., Veterivel, V.: On approximate minima in vector optimization. Numer. Funct. Anal. Optim. 22, 845–859 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dutta, J., Yalcin Kaya, C.: A new scalarization and numerical method for constructing weak pareto front of multi-objecitve optimization problems. Optimization 107, 627–640 (2011)

    Google Scholar 

  9. Ehrgott, M., Ruzika, S.: Improved \(\varepsilon \)-constraint method for multiobjective programming. J. Optim. Theory Appl. 138, 375–396 (2008)

  10. Engau, A., Wiecek, M.M.: Generating \(\varepsilon \)-efficient solusions in multiobjective programming. Eur. J. Oper. Res. 177, 1566–1579 (2007)

  11. Gao, Y., Yang, X.M., Teo, K.L.: Optimality conditions for approximate solutions of vector optimization problems. J. Ind. Manag. Optim 7, 483–496 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gao, Y., Hou, S.H., Yang, X.M.: Existence and optimality conditions for approximate solutions to vector optimization problems. J. Optim. Theory Appl. 152, 97–120 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ghaznavi-ghosoni, B.A., Khorram, E., Solemani-damaneh, M.: Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization. Optimization 62, 703–720 (2013)

  14. Gupta, D., Mehra, A.: Two types of approximate saddle points. Numer. Funct. Anal. Optim. 29, 532–550 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gutiérrez, C., Jiménez, B., Novo, V.: Multiplier rules and saddle-point theorems for Helbig’s approximate solutions in convex Pareto problems. J. Glob. Optim. 32, 367–383 (2005)

    Article  MATH  Google Scholar 

  16. Gutiérrez, C., Jiménez, B., Novo, V.: On approximate efficiency in multiobjective programming. Math. Methods Oper. Res. 64, 165–185 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gutiérrez, C., Jiménez, B., Novo, V.: A unified approach and optimality conditions for approximate solutions of vector optimization problems. SIAM J. Optim. 17, 688–710 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Gutiérrez, C., Jiménez, B., Novo, V.: A set-valued Ekeland’s variational principle in vector optimization. SIAM J. Control Optim. 47, 883–903 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  19. Gutiérrez, C., Lopez, R., Novo, V.: Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: Existence results and optimality conditions. Nonlinear Anal. 72, 4331–4346 (2010)

  20. Gutiérrez, C., Huerga, L., Novo, V.: Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems. J. Math. Anal. Appl. 389, 367–383 (2012)

    Article  MathSciNet  Google Scholar 

  21. Hamel, A.: An \(\varepsilon \)-Lagrange multiplier rule for a mathematical programming problem on Banach spaces. Optimization 49, 137–149 (2001)

  22. Helbig, S.: One new concept for \(\varepsilon \)-efficency, talk at “Optimization Days 1992”, Montreal (1992)

  23. Huang, X.X.: Optimality conditions and approximate optimality conditions in locally Lipschitz vector optimization. Optimization 51, 309–321 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  24. Kutateladze, S.S.: Convex \(\varepsilon -\)programming. Sov. Math. Dokl. 20, 390–393 (1979)

  25. Loridan, P.: Necessary conditions fo \(\varepsilon -\)optimality. Math. Program. Stud. 19, 140–152 (1982)

  26. Loridan, P.: \(\varepsilon -\)solutions in vector optimization problems. J. Optim. Theory Appl. 43, 265–276 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  27. Pascoletti, A., Serafini, P.: Scalarizing vector optimization problems, J. Optim. Theory Appl. 42, 499–524 (1984)

  28. Qiu, J.H.: Ekeland’s variational principle in locally convex spaces and the density of extremal points. J. Math. Anal. Appl. 360, 317–327 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  29. Qiu, J.H.: A generalized Ekeland vector variational principle and its applications in optimization. Nonlinear Anal. 71, 4705–4717 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  30. Tanaka, T.: A new approach to approximation of solutions in vector optimization problems. In: Fushimi, M., Tone, K. (eds.) Proceedings of Asia-Pacific Operations Research Society, 1994, pp. 497–504. World Scientific, Singapore (1995)

  31. White, D.J.: Epsilon efficiency. J. Optim. Theory Appl. 49, 319–337 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Chongqing Normal University, Chongqing, 400047, China

    Rui-Xue Yue & Ying Gao

Authors
  1. Rui-Xue Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ying Gao.

Additional information

This work was partially supported by the National Natural Science Foundation of China (11201511,11271391).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yue, RX., Gao, Y. Scalarizations for Approximate Quasi Efficient Solutions in Multiobjective Optimization Problems. J. Oper. Res. Soc. China 3, 69–80 (2015). https://doi.org/10.1007/s40305-015-0075-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40305-015-0075-1

Keywords

Mathematics Subject Classification

Search

Navigation