arXiv Analytics

Sign in

arXiv:2211.07611 [math.OC]AbstractReferencesReviewsResources

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces

Maryam Saadati, Morteza Oveisiha

Published 2022-11-14Version 1

This article is concerned with a nonsmooth/nonconvex composite multiobjective optimization problem involving uncertain constraints in arbitrary Asplund spaces. Employing some advanced techniques of variational analysis and generalized differentiation, we establish necessary optimality conditions for weakly robust efficient solutions of the problem in terms of the limiting subdifferential. Sufficient conditions for the existence of (weakly) robust efficient solutions to such a problem are also driven under the new concept of pseudo-quasi convexity for composite functions. Finally, we formulate a Mond-Weir-type robust dual problem to the primal problem, and explore weak, strong, and converse duality properties.

Comments: arXiv admin note: substantial text overlap with arXiv:2105.14366, arXiv:2205.01145
Categories: math.OC
Subjects: 49K99, 65K10, 90C29, 90C46
Related articles: Most relevant | Search more
arXiv:1106.0791 [math.OC] (Published 2011-06-04, updated 2019-01-10)
Optimality Conditions for Bilevel Programming Problem in Asplund Spaces
arXiv:2205.01145 [math.OC] (Published 2022-05-02)
Approximate solutions for robust multiobjective optimization programming in Asplund spaces
arXiv:2105.14366 [math.OC] (Published 2021-05-29)
Optimality conditions for robust nonsmooth multiobjective optimization problems in Asplund spaces