Sample-path optimization of convex stochastic performance functions

作者: Erica L. Plambeck , Bor-Ruey Fu , Stephen M. Robinson , Rajan Suri

DOI: 10.1007/BF02592150

关键词:

摘要: In this paper we propose a method for optimizing convex performance functions in stochastic systems. These can include expected static systems and steady-state discrete-event dynamic systems; they may be nonsmooth. The is closely related to retrospective simulation optimization; it appears overcome some limitations of approximation, which often applied such problems. We explain the give computational results two classes problems: tandem production lines with up 50 machines, PERT (Program Evaluation Review Technique) problems 70 nodes 110 arcs.

参考文章(48)
Thomas L. Magnanti, Stephen P. Bradley, Arnoldo C. Hax, Applied Mathematical Programming ,(1977)
Richard D. Wollmer, Critical path planning under uncertainty Mathematical Programming Essays in Honor of George B. Dantzig Part II. ,vol. 25, pp. 164- 171 ,(1985) , 10.1007/BFB0121082
H. Attouch, Variational convergence for functions and operators Pitman Advanced Pub. Program. ,(1984)
Paul Glasserman, Yu-Chi Ho, Gradient Estimation Via Perturbation Analysis ,(1990)
Marco A. Mongalo, Jim Lee, A comparative study of methods for probabilistic project scheduling annual conference on computers. ,vol. 19, pp. 505- 509 ,(1990) , 10.1016/0360-8352(90)90169-M
Laurence A. Wolsey, George L. Nemhauser, Integer and Combinatorial Optimization ,(1988)
Herbert Robbins, Sutton Monro, A Stochastic Approximation Method Annals of Mathematical Statistics. ,vol. 22, pp. 400- 407 ,(1951) , 10.1214/AOMS/1177729586
Peter Kall, Approximation to Optimization Problems: An Elementary Review Mathematics of Operations Research. ,vol. 11, pp. 9- 18 ,(1986) , 10.1287/MOOR.11.1.9