A branch and bound method for stochastic global optimization
- Cite this article as:
- Norkin, V.I., Pflug, G.C. & Ruszczyński, A. Mathematical Programming (1998) 83: 425. doi:10.1007/BF02680569
- 858 Downloads
A stochastic branch and bound method for solving stochastic global optimization problems is proposed. As in the deterministic case, the feasible set is partitioned into compact subsets. To guide the partitioning process the method uses stochastic upper and lower estimates of the optimal value of the objective function in each subset. Convergence of the method is proved and random accuracy estimates derived. Methods for constructing stochastic upper and lower bounds are discussed. The theoretical considerations are illustrated with an example of a facility location problem.