Please use this identifier to cite or link to this item:
|Title:||Optimal computing budget allocation for constrained optimization|
|Citation:||Pujowidianto, N.A.,Lee, L.H.,Chen, C.-H.,Yap, C.M. (2009). Optimal computing budget allocation for constrained optimization. Proceedings - Winter Simulation Conference : 584-589. ScholarBank@NUS Repository. https://doi.org/10.1109/WSC.2009.5429658|
|Abstract:||In this paper, we consider the problem of selecting the best design from a discrete number of alternatives in the presence of a stochastic constraint via simulation experiments. The best design is the design with smallest mean of main objective among the feasible designs. The feasible designs are the designs of which constraint measure is below the constraint limit. The Optimal Computing Budget Allocation (OCBA) framework is used to tackle the problem. In this framework, we aim at maximizing the probability of correct selection given a computing budget by controlling the number of simulation replications. An asymptotically optimal allocation rule is derived. A comparison with Equal Allocation (EA) in the numerical experiments shows that the proposed allocation rule gains higher probability of correct selection. ©2009 IEEE.|
|Source Title:||Proceedings - Winter Simulation Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2018
checked on Oct 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.