The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs

Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In previous contributions, it has been shown that solutions to uncertain convex programs that bear a high probability to satisfy uncertain constraints can be obtained at low computational cost through constraints randomization. In this paper, we establish new feasibility results for randomized algorithms. Specifically, the exact feasibility for the class of the so-called fully-supported problems is obtained. It turns out that all fully-supported problems share the same feasibility properties, revealing a deep kinship among problems of this class. It is further proven that the feasibility of the randomized solutions for all other convex programs can be bounded based on the feasibility for the prototype class of fully-supported problems. The feasibility result of this paper outperforms previous bounds, and is not im...

• Type: Journal
• Year: 2008
• Where: SIAMJO
• Authors: Marco C. Campi, Simone Garatti
• Keywords: Convex Programs, Fully-supported Problems, Problems, SIAMJO 2008