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:	Applied mathematics Business and Management Combinatorics Game theory Integer programming Linear programming Mathematical optimization Mathematical programming Minimax technique Multiple objective analysis Operations research Operations Research/Decision Theory Optimization Original Research Pareto optimization Pareto principle Robustness (mathematics) Theory of Computation China 90C46 Minimax programming KKT optimality conditions 90C25 Multi-objective optimization Duality Generalized convexity
ISSN:	0254-5330, 1572-9338
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!