Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BF02680569 | Math. Program. |
Keywords | Field | DocType |
Stochastic programming, Global optimization, Branch and bound method, Facility location | Convergence of random variables,Stochastic optimization,Mathematical optimization,Global optimization,Facility location problem,Continuous-time stochastic process,Branch and bound method,Stochastic programming,Mathematics,Global optimization problem | Journal |
Volume | Issue | ISSN |
83 | 1-3 | 1436-4646 |
Citations | PageRank | References |
95 | 11.01 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vladimir I. Norkin | 1 | 133 | 17.03 |
| Georg Ch. Pflug | 2 | 385 | 54.09 |
| Andrzej Ruszczyński | 3 | 798 | 84.38 |