A branch and bound method for stochastic global optimization

Fecha:	1998
Resumen:	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. .
Derechos:	Tots els drets reservats.
Lengua:	Anglès
Documento:	Article ; recerca ; Versió publicada
Materia:	Stochastic programming ; Global optimization ; Branch and bound method ; Facility location
Publicado en:	Mathematical Programming, vol. 83 n. 3 (1998) p. 425-450, ISSN 0025-5610

26 p, 871.8 KB

Acceso restringido a la UAB

Registro creado el 2006-03-13, última modificación el 2023-06-03