Minimax programming as a tool for studying robust multi-objective optimization problems

This paper aims to investigate optimality conditions for a weakly Pareto solution to a robust multi-objective optimization problem with locally Lipschitzian data. We do this by using a minimax programming approach , namely, by establishing the necessary optimality condition for a (local) optimal sol...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research Jg. 319; H. 2; S. 1589 - 1606
Hauptverfasser: Hong, Zhe, Bae, Kwan Deok, Kim, Do Sang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.12.2022
Springer
Springer Nature B.V
Schlagworte:
ISSN:0254-5330, 1572-9338
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper aims to investigate optimality conditions for a weakly Pareto solution to a robust multi-objective optimization problem with locally Lipschitzian data. We do this by using a minimax programming approach , namely, by establishing the necessary optimality condition for a (local) optimal solution to a robust minimax optimization problem under a suitable constraint qualification, we then employ it to arrive in the desired target. In addition, some duality results for both robust minimax optimization problems and robust multi-objective optimization problems are also provided.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-021-04179-w