EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems

Vivek Laha, Rahul Kumar, Jitendra Maurya

Yugoslav Journal of Operations Research · 2022 · 32 (3) · 283-297

DOI: 10.2298/yjor201223001l ↗

Kurz gefasst

Fachartikel in der Zeitschrift Yugoslav Journal of Operations Research, 2022. Verfasst von Vivek Laha und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 54 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we consider a nonlinear semidefinite semi-infinite convex multiobjective optimization problem where the feasible region is determined by finite number of equality and infinite number of inequality constraints. We establish saddle point necessary and sufficient optimality conditions under some suitable constraint qualification. We establish Karush-Kuhn-Tucker optimality conditions using the saddle point optimality conditions for the differentiable case and construct some examples to illustrate our results.

Zitieren

APA

Laha, V., Kumar, R., & Maurya, J. (2022). Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems. Yugoslav Journal of Operations Research, 32(3), 283-297. https://doi.org/10.2298/yjor201223001l

Vancouver

Laha V, Kumar R, Maurya J. Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems. Yugoslav Journal of Operations Research. 2022;32(3):283-297. doi:10.2298/yjor201223001l

BibTeX
@article{Laha2022,
  author = {Laha, Vivek and Kumar, Rahul and Maurya, Jitendra},
  title = {Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems},
  journal = {Yugoslav Journal of Operations Research},
  year = {2022},
  volume = {32},
  number = {3},
  pages = {283--297},
  doi = {10.2298/yjor201223001l}
}
Kostenlos starten →