This paper describes a possibility for approximate solution of stochastic programming problems with complete recourse. We replace the static form of linear problem in Lp-space by a sequence of discretized problems in finite-dimensional spaces. We present conditions that guarantee the convergence of optimal values of discretized problems to the optimal value of the initial problem.