Robust duality for generalized convex programming problems under data uncertainty |
| |
Authors: | V. Jeyakumar G. LiG.M. Lee |
| |
Affiliation: | a Department of Applied Mathematics, University of New South Wales, Sydney 2052, Australiab Department of Applied Mathematics, Pukong National University, Busan 608-737, Republic of Korea |
| |
Abstract: | 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. |
| |
Keywords: | 90C22 90C25 90C46 |
本文献已被 ScienceDirect 等数据库收录! |
|