Institute of Information Theory and Automation

You are here


Conference Paper (international conference)

Notes on approximation of stochastic programming problem

Šmíd Martin

: Proceedings of the 21st International Conference Mathematical Methods in Economics 2003, p. 244-251 , Eds: Houška M.

: Czech University of Agriculture, (Prague 2003)

: MME 2003, (Prague, CZ, 10.09.2003-12.09.2003)

: CEZ:AV0Z1075907

: GA402/01/0539, GA ČR

: stochastic programming, discretization, Monte Carlo

(eng): In stochastic optimization problems, expectation of random function is often being minimized. Since the expectation can rarely be evaluated exactly an approximation has to be done. In the present paper, three types of approximation are dealt with: discretization, Monte Carlo and Quasi Monte Carlo. Convergence rate of the approximation error is evaluated and some upper bounds of the error are given.

: 12B

: AH

2019-01-07 08:39