Conditioning of stochastic programs

Abstract

In this paper we consider stochastic programming problems where the objective function is given as an expected value function. With an optimal solution of such a (convex) problem we associate a condition number which characterizes well or ill conditioning of the problem. We show that the sample size needed to calculate the optimal solution of such problem with a given probability is approximately proportional to the condition number.