Simulation-based optimization over discrete sets with noisy constraints

We consider a constrained optimization problem over a discrete set where noise-corrupted observations of the objective and constraints are available. The problem is challenging because the feasibility of a solution cannot be known for certain, due to the noisy measurements of the constraints. To tackle this issue, we propose a new method that converts constrained optimization into the unconstrained optimization problem of finding a saddle point of the Lagrangian. The method applies stochastic approximation to the Lagrangian in search of the saddle point. The proposed method is shown to converge, under suitable conditions, to the optimal solution almost surely (a.s.) as the number of iterations grows. We present the effectiveness of the proposed method numerically in two settings: (1) inventory control in a periodic review system, and (2) staffing in a call center.

[1]  Yu-Chi Ho,et al.  Ordinal optimization of DEDS , 1992, Discret. Event Dyn. Syst..

[2]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[3]  S. Mitter,et al.  Simulated annealing with noisy or imprecise energy measurements , 1989 .

[4]  Jian Song,et al.  On the Convexity of Discrete (r,Q) and (S,T) Inventory Systems , 2008 .

[5]  Gunar E. Liepins,et al.  Genetic algorithms: Foundations and applications , 1990 .

[6]  Harold J. Kushner,et al.  wchastic. approximation methods for constrained and unconstrained systems , 1978 .

[7]  Leyuan Shi,et al.  Nested Partitions Method for Stochastic Optimization , 2000 .

[8]  C. Cassandras,et al.  Generalized Surrogate Problem Methodology for Online Stochastic Discrete Optimization , 2002 .

[9]  Barry L. Nelson,et al.  Ranking, selection and multiple comparisons in computer simulation , 1994, Proceedings of Winter Simulation Conference.

[10]  S. Andradóttir A method for discrete stochastic optimization , 1995 .

[11]  Pierre Priouret,et al.  Adaptive Algorithms and Stochastic Approximations , 1990, Applications of Mathematics.

[12]  Jr-Shin Li,et al.  Ensemble Control of Bloch Equations , 2009, IEEE Transactions on Automatic Control.

[13]  V. Dupac,et al.  Stochastic approximation on a discrete set and the multi-armed bandit problem , 1982 .

[14]  Talal M. Alkhamis,et al.  Optimizing discrete stochastic systems using simulated annealing and simulation , 1997 .

[15]  Sigrún Andradóttir,et al.  Finding the best in the presence of a stochastic constraint , 2005, Proceedings of the Winter Simulation Conference, 2005..

[16]  J. Gawroński Amsterdam , 2008, Water in Times of Climate Change.

[17]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[18]  Michael C. Fu,et al.  Feature Article: Optimization for simulation: Theory vs. Practice , 2002, INFORMS J. Comput..

[19]  Barry L. Nelson,et al.  Optimization via simulation over discrete decision variables , 2010 .

[20]  László Gerencsér,et al.  Optimization over discrete sets via SPSA , 1999, WSC '99.

[21]  Loo Hay Lee,et al.  Optimal Computing Budget Allocation for constrained optimization , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[22]  Barry L. Nelson,et al.  Discrete Optimization via Simulation Using COMPASS , 2006, Oper. Res..

[23]  Simulation-based optimization over discrete sets with noisy constraints , 2011, WSC 2011.

[24]  H. Kushner,et al.  Stochastic approximation of constrained systems with system and constraint noise , 1975, at - Automatisierungstechnik.

[25]  Andrei A. Prudius,et al.  Adaptive random search for continuous simulation optimization , 2010 .

[26]  Seong-Hee Kim,et al.  Finding feasible systems in the presence of constraints on multiple performance measures , 2010, TOMC.

[27]  Sigrún Andradóttir,et al.  Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization , 2009, INFORMS J. Comput..

[28]  Stacy D. Hill,et al.  Constrained optimization over discrete sets via SPSA with application to non-separable resource allocation , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[29]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[30]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[31]  Michael C. Fu,et al.  Optimization for Simulation: Theory vs. Practice , 2002 .

[32]  Jie Li,et al.  Simulation-Based Discrete Optimization of Stochastic Discrete Event Systems Subject to Non Closed-Form Constraints , 2009, IEEE Transactions on Automatic Control.

[33]  S. Andradóttir,et al.  Fully sequential procedures for comparing constrained systems via simulation , 2010 .

[34]  E. M. L. Beale,et al.  Nonlinear Programming: A Unified Approach. , 1970 .

[35]  D. Yan,et al.  Stochastic discrete optimization , 1992 .

[36]  J. Marsden,et al.  Elementary classical analysis , 1974 .

[37]  D. Luenberger Optimization by Vector Space Methods , 1968 .

[38]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[39]  Zsolt Páles,et al.  ON ϕ-CONVEXITY , 2012 .