Skip to main content
SpringerLink
Log in

On \(\varepsilon \)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data

  • Published:
Positivity Aims and scope Submit manuscript

Abstract

In this paper, we investigate optimality conditions and duality for \(\varepsilon \)-quasi efficient solutions of the fractional infinite multiobjective optimization problems with locally Lipschitz data. The obtained results improve or include some recent known ones. Several illustrative examples are also provided.

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. Bae, K.D., Shitkovskaya, T., Kim, D.S.: A note on minimax optimization problems with an infinite number of constraints. J. Appl. Numer. Optim. 3, 521–531 (2021)

    Google Scholar 

  2. Chuong, T.D., Huy, N.Q., Yao, J.-C.: Subdifferentials of marginal functions in semi-infinite programming. SIAM J. Optim. 20, 1462–1477 (2009)

    Article  MathSciNet  Google Scholar 

  3. Chuong, T.D., Kim, D.S.: Nonsmooth semi-infinite multiobjective optimization problems. J. Optim. Theory Appl. 160, 748–762 (2014)

    Article  MathSciNet  Google Scholar 

  4. Chuong, T.D., Yao, J.-C.: Isolated and proper efficiencies in semi-infinite vector optimization problems. J. Optim. Theory Appl. 162, 447–462 (2014)

    Article  MathSciNet  Google Scholar 

  5. Chuong, T.D., Kim, D.S.: Approximate solutions of multiobjective optimization problems. Positivity 20, 187–207 (2016)

    Article  MathSciNet  Google Scholar 

  6. Chuong, T.D.: Nondifferentiable fractional semi-infinite multiobjective optimization problems. Oper. Res. Lett. 44, 260–266 (2016)

    Article  MathSciNet  Google Scholar 

  7. Chuong, T.D., Kim, D.S.: A class of nonsmooth fractional multiobjective optimization problems. Ann. Oper. Res. 244, 367–383 (2016)

    Article  MathSciNet  Google Scholar 

  8. Chuong, T.D., Kim, D.S.: Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications. Ann. Oper. Res. 267, 81–99 (2018)

    Article  MathSciNet  Google Scholar 

  9. Correa, R., López, M.A., Pérez-Aros, P.: Necessary and sufficient optimality conditions in DC semi-infinite programming. SIAM J. Optim. 31, 837–865 (2021)

    Article  MathSciNet  Google Scholar 

  10. Dinh, N., Goberna, M.A., López, M.A., Son, T.Q.: New Farkas-type constraint qualifications in convex infinite programming. ESAIM Control Optim. Calc. Var. 13, 580–597 (2007)

    Article  MathSciNet  Google Scholar 

  11. Dinh, N., Mordukhovich, B.S., Nghia, T.T.A.: Qualification and optimality conditions for DC programs with infinite constraints. Acta Math. Vietnam 34, 123–153 (2009)

    MathSciNet  Google Scholar 

  12. Fakhara, M., Mahyarinia, M.R., Zafarani, J.: On approximate solutions for nonsmooth robust multiobjective optimization problems. Optimization 68, 1653–1683 (2019)

    Article  MathSciNet  Google Scholar 

  13. Hantoute, A., López, M.A.: A complete characterization of the subdifferential set of the supremum of an arbitrary family of convex functions. J. Convex Anal. 15, 831–858 (2008)

    MathSciNet  Google Scholar 

  14. Hantoute, A., López, M.A., Zălinescu, C.: Subdifferential calculus rules in convex analysis: a unifying approach via pointwise supremum functions. SIAM J. Optim. 19, 863–882 (2008)

    Article  MathSciNet  Google Scholar 

  15. Jiao, L.G., Dinh, B.V., Kim, D.S., Yoon, M.: Mixed type duality for a class of multiple objective optimization problems with an infinite number of constraints. J. Nonlinear Convex Anal. 21, 49–61 (2020)

    MathSciNet  Google Scholar 

  16. Jiao, L.G., Kim, D.S., Zhou, Y.Y.: Quasi \(\varepsilon \)-solution in a semi-infinite programming problem with locally Lipschitz data. Optim. Lett. 15, 1759–1772 (2021)

    Article  MathSciNet  Google Scholar 

  17. Kanzi, N.: Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints. SIAM J. Optim. 24, 559–572 (2014)

    Article  MathSciNet  Google Scholar 

  18. Kanzi, N., Nobakhtian, S.: Optimality conditions for nonsmooth semi-infinite multiobjective programming. Optim. Lett. 8, 1517–1528 (2014)

    Article  MathSciNet  Google Scholar 

  19. Kanzi, N.: On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data. Optim. Lett. 9, 1121–1129 (2015)

    Article  MathSciNet  Google Scholar 

  20. Khanh, P.Q., Tung, N.M.: On the Mangasarian–Fromovitz constraint qualification and Karush–Kuhn–Tucker conditions in nonsmooth semi-infinite multiobjective programming. Optim. Lett. 14, 2055–2072 (2020)

    Article  MathSciNet  Google Scholar 

  21. Khantree, C., Wangkeeree, R.: On quasi approximate solutions for nonsmooth robust semiinfinite optimization problems. Carpathian J. Math. 35, 417–426 (2019)

    Article  MathSciNet  Google Scholar 

  22. Kim, D.S., Son, T.Q.: An approach to \(\varepsilon \)-duality theorems for nonconvex semi-infinite multiobjective optimization problems. Taiwan. J. Math. 22, 1261–1287 (2018)

    MathSciNet  Google Scholar 

  23. Li, C., Ng, K.F., Pong, T.K.: Constraint qualifications for convex inequality systems with applications in constrained optimization. SIAM J. Optim. 19, 163–187 (2008)

    Article  MathSciNet  Google Scholar 

  24. Long, X.J., Xiao, Y.B., Huang, N.J.: Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems. J. Oper. Res. Soc. China 6, 289–299 (2018)

    Article  MathSciNet  Google Scholar 

  25. Long, X.J., Liu, J., Huang, N.J.: Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials. Numer. Funct. Anal. Optim. 42, 279–297 (2021)

    Article  MathSciNet  Google Scholar 

  26. Loridan, P.: Necessary conditions for \(\varepsilon \)-optimality. Optimality and stability in mathematical programming. Math. Program. Study 19, 140–152 (1982)

    Article  Google Scholar 

  27. Loridan, P.: \(\varepsilon \)-Solutions in vector minimization problems. J. Optim. Theory Appl. 43, 265–276 (1984)

    Article  MathSciNet  Google Scholar 

  28. Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation. I: Basic Theory. Springer, Berlin (2006)

    Book  Google Scholar 

  29. Mordukhovich, B.S., Nghia, T.T.A.: Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data. SIAM J. Optim. 23, 406–431 (2013)

    Article  MathSciNet  Google Scholar 

  30. Mordukhovich, B.S., Nghia, T.T.A.: Nonsmooth cone-constrained optimization with applications to semi-infinite programming. Math. Oper. Res. 39, 301–324 (2014)

    Article  MathSciNet  Google Scholar 

  31. Mordukhovich, B.S.: Variational Analysis and Applications. Springer Monographs in Mathematics. Springer, Cham (2018)

    Book  Google Scholar 

  32. Mordukhovich, B.S., Pérez-Aros, P.: New extremal principles with applications to stochastic and semi-infinite programming. Math. Program. 189, 527–553 (2021)

    Article  MathSciNet  Google Scholar 

  33. Pham, T.H.: On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems. Positivity 27, 1–31 (2023)

    Article  MathSciNet  Google Scholar 

  34. Pérez-Aros, P.: Formulae for the conjugate and the subdifferential of the supremum function. J. Optim. Theory Appl. 180, 397–427 (2019)

    Article  MathSciNet  Google Scholar 

  35. Pérez-Aros, P.: Subdifferential formulae for the supremum of an arbitrary family of functions. SIAM J. Optim. 29, 1714–1743 (2019)

    Article  MathSciNet  Google Scholar 

  36. Shitkovskaya, T., Hong, Z., Kim, D.S., Piao, G.R.: Approximate necessary optimality in fractional semi-infinite multiobjective optimization. J. Nonlinear Convex Anal. 21, 195–204 (2020)

    MathSciNet  Google Scholar 

  37. Shitkovskaya, T., Jiao, L., Kim, D.S.: Multi-criteria optimization problems with fractional objectives: approximate optimality and approximate duality. J. Nonlinear Convex Anal. 22, 1117–1131 (2021)

    MathSciNet  Google Scholar 

  38. Son, T.Q., Strodiot, J.J., Nguyen, V.H.: \(\varepsilon \)-Optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints. J. Optim. Theory Appl. 141, 389–409 (2009)

    Article  MathSciNet  Google Scholar 

  39. Son, T.Q., Kim, D.S.: \(\varepsilon \)-Mixed duality for nonconvex multiobjective programs with an infinite number of constraints. J. Glob. Optim. 57, 447–465 (2013)

    Article  MathSciNet  Google Scholar 

  40. Son, T.Q., Tuyen, N.V., Wen, C.F.: Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints. Acta Math. Vietnam 45, 435–448 (2020)

    Article  MathSciNet  Google Scholar 

  41. Sun, X.K., Teo, K.L., Zheng, J., Liu, L.: Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty. Optimization 69, 2109–2020 (2020)

    Article  MathSciNet  Google Scholar 

  42. Tung, L.T.: Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential. RAIRO Oper. Res. 52, 1019–1041 (2018)

    Article  MathSciNet  Google Scholar 

  43. Tung, L.T.: Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials. Numer. Funct. Anal. Optim. 41, 659–684 (2020)

    Article  MathSciNet  Google Scholar 

  44. Tung, L.T.: Strong Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming. Bull. Braz. Math. Soc. 52, 1–22 (2021)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author would like to thank the Editors and Professor Boris Mordukhovich for the help in the processing of the article. The author is very grateful to the Anonymous Referee for the very valuable remarks, which helped to improve the article.

Funding

This article is not funded by a research project.

Author information

Authors and Affiliations

  1. Faculty of Pedagogy and Faculty of Social Sciences and Humanities, Kien Giang University, Kien Giang, 920000, Vietnam

    Thanh-Hung Pham

Authors
  1. Thanh-Hung Pham
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

T-HP: Conceptualization, Methodology, Writing—original draft, Data curation, Writing—review and editing, Supervision.

Corresponding author

Correspondence to Thanh-Hung Pham.

Ethics declarations

Conflict of interest

The author has no conflict of interest to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pham, TH. On \(\varepsilon \)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data. Positivity 28, 28 (2024). https://doi.org/10.1007/s11117-024-01046-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11117-024-01046-3

Keywords

Mathematics Subject Classification

Search

Navigation