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...
Saved in:
| Published in: | Annals of operations research Vol. 319; no. 2; pp. 1589 - 1606 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.12.2022
Springer Springer Nature B.V |
| Subjects: | |
| ISSN: | 0254-5330, 1572-9338 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Bibliography: | 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 |