Sciweavers

44 search results - page 2 / 9
» Sequential sampling for solving stochastic programs
Sort
View
ANOR
2006
59views more  ANOR 2006»
13 years 5 months ago
The empirical behavior of sampling methods for stochastic programming
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
Jeff Linderoth, Alexander Shapiro, Stephen Wright
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
13 years 9 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noisy BBOB-2010 testbed
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD . Recently, ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
MP
2008
117views more  MP 2008»
13 years 5 months ago
Stochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
Alexander Shapiro
SAGA
2005
Springer
13 years 10 months ago
Dynamic Facility Location with Stochastic Demands
Abstract. In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming ...
Martin Romauch, Richard F. Hartl
SIAMJO
2002
124views more  SIAMJO 2002»
13 years 4 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...