.png){kind=icon}
.png){kind=icon}
Return
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-019-03216-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, a mathematical programming problem under affinely parameterized uncertain data with multiple objective functions given by SOS-convex polynomials, denoting by (UMP), is considered; moreover, its robust counterpart, denoting by (RMP), is proposed by following the robust optimization approach (worst-case approach). Then, by employing the well-known epsilon-constraint method (a scalarization technique), we substitute (RMP) by a class of scalar problems. Under some suitable conditions, a zero duality gap result, between each scalar problem and its relaxation problems, is established; moreover, the relationship of their solutions is also discussed. As a consequence, we observe that finding robust efficient solutions to (UMP) is tractable by such a scalarization method. Finally, a nontrivial numerical example is designed to show how to find robust efficient solutions to (UMP) by applying our results.
Keywords:
Multiobjective optimization
Robust optimization
Semidefinite programming relaxations
SOS-convex polynomials
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W