Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications

In this article, we employ advanced techniques of convex analysis and $ \mathcal {C} $ C -differentiation to examine KKT-type robust necessary and sufficient optimality conditions and robust duality for an uncertain multiobjective programming problem under uncertainty sets, where $ \mathcal {C} $ C...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization Jg. 73; H. 3; S. 641 - 672
Hauptverfasser:	Nguyen, Thuy Thi Thu, Su, Tran Van, Linh, Dang Hong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Taylor & Francis 03.03.2024 Taylor & Francis LLC
Schlagworte:	Convex analysis Convexity Derivatives duality theorems KKT-type robust optimality conditions mathcal {C} Mathematical programming Multiobjective programming problem with uncertain data Multiple objective analysis Robustness (mathematics) Uncertainty uncertainty sets
ISSN:	0233-1934, 1029-4945
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!