Robust strong duality for nonconvex optimization problem under data uncertainty in constraint
This paper deals with the robust strong duality for nonconvex optimization problem with the data uncertainty in constraint. A new weak conjugate function which is abstract convex, is introduced and three kinds of robust dual problems are constructed to the primal optimization problem by employing th...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-08-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://aimspress.com/article/doi/10.3934/math.2021713?viewType=HTML |