A Branch and Bound Method for Stochastic Global Optimization
A stochastic version of the branch and bound method is proposed for solving stochastic global optimization problems. The method, instead of deterministic bounds, uses stochastic upper and lower estimates of the optimal value of subproblems, to guide the partitioning process. Almost sure convergence of the method is proved and random accuracy estimates derived. Methods for constructing random bounds for stochastic global optimization problems are discussed. The theoretical considerations are illustrated with an example of a facility location problem.
|Date of creation:||Jun 1996|
|Date of revision:|
|Contact details of provider:|| Postal: A-2361 Laxenburg|
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- V.I. Norkin & Y.M. Ermoliev & A. Ruszczynski, 1994. "On Optimal Allocation of Indivisibles Under Uncertainty," Working Papers wp94021, International Institute for Applied Systems Analysis.
- LABBE, Martine & PEETERS, Dominique & THISSE, Jacques-FranÃ§ois, 1993.
"Location on Networks,"
CORE Discussion Papers
1993040, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp96065. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.