Characterizations of robust solution set of convex programs with uncertain data
© 2017 Springer-Verlag GmbH Germany In this paper, we study convex programming problems with data uncertainty in both the objective function and the constraints. Under the framework of robust optimization, we employ a robust regularity condition, which is much weaker than the ones in the open litera...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer Verlag
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/62847 |
| Summary: | © 2017 Springer-Verlag GmbH Germany In this paper, we study convex programming problems with data uncertainty in both the objective function and the constraints. Under the framework of robust optimization, we employ a robust regularity condition, which is much weaker than the ones in the open literature, to establish various properties and characterizations of the set of all robust optimal solutions of the problems. These are expressed in term of subgradients, Lagrange multipliers and epigraphs of conjugate functions. We also present illustrative examples to show the significances of our theoretical results. |
|---|