Journal
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS
Volume 75, Issue 3, Pages 1362-1373Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.na.2011.04.006
Keywords
Robust optimization; Generalized convexity; Duality under uncertainty; Robust quadratic optimization
Categories
Funding
- Australian Research Council
- Korea Science and Engineering Foundation (KOSEF) NRL
- Korea government (MEST) [ROA-2008-000-20010-0]
Ask authors/readers for more resources
In this paper we present a robust duality theory for generalized convex programming problems in the face of data uncertainty within the framework of robust optimization. We establish robust strong duality for an uncertain nonlinear programming primal problem and its uncertain Lagrangian dual by showing strong duality between the deterministic counterparts: robust counterpart of the primal model and the optimistic counterpart of its dual problem. A robust strong duality theorem is given whenever the Lagrangian function is convex. We provide classes of uncertain non-convex programming problems for which robust strong duality holds under a constraint qualification. In particular, we show that robust strong duality is guaranteed for non-convex quadratic programming problems with a single quadratic constraint with the spectral norm uncertainty under a generalized Slater condition. Numerical examples are given to illustrate the nature of robust duality for uncertain nonlinear programming problems. We further show that robust duality continues to hold under a weakened convexity condition. (C) 2011 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available