EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The Levitin-Polyak well-posedness for the set optimization problem via the upper set-less order relation

Tran Thi Thuy Duong

JOURNAL OF SCIENCE AND DEVELOPMENT ECONOMICS · 13.06.2026 · (4) · 1-11

DOI: 10.64632/jsde.eng.4.2026.940 ↗

Kurz gefasst

Fachartikel in der Zeitschrift JOURNAL OF SCIENCE AND DEVELOPMENT ECONOMICS, online erschienen am 13.06.2026. Verfasst von Tran Thi Thuy Duong. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper investigates the generalized Levitin–Polyak (gLP) well-posedness for set optimization problems with respect to the upper set-less order relation. By employing tools from set-valued analysis, we established several sufficient conditions ensuring the gLP well-posedness under Hausdorff-type continuity via cone, Lipschitz conditions and compactness assumptions. In addition, we introduced the induction phenomenon property to analyze the convergence conditions of minimizing sequences. The obtained results extend existing works by weakening continuity assumptions. Several examples are presented to illustrate the applicability of the results.

Zitieren

APA

Duong, T. T. T. (2026). The Levitin-Polyak well-posedness for the set optimization problem via the upper set-less order relation. JOURNAL OF SCIENCE AND DEVELOPMENT ECONOMICS, 1-11. https://doi.org/10.64632/jsde.eng.4.2026.940

Vancouver

Duong TTT. The Levitin-Polyak well-posedness for the set optimization problem via the upper set-less order relation. JOURNAL OF SCIENCE AND DEVELOPMENT ECONOMICS. 2026:1-11. doi:10.64632/jsde.eng.4.2026.940

BibTeX
@article{Duong2026,
  author = {Duong, Tran Thi Thuy},
  title = {The Levitin-Polyak well-posedness for the set optimization problem via the upper set-less order relation},
  journal = {JOURNAL OF SCIENCE AND DEVELOPMENT ECONOMICS},
  year = {2026},
  number = {4},
  pages = {1--11},
  doi = {10.64632/jsde.eng.4.2026.940}
}
Kostenlos starten →