Abstract
We develop a new Optimal Computing Budget Allocation (OCBA) approach for the ranking and selection problem with stochastic constraints. The goal is to maximize the probability of correctly selecting the best feasible design within a fixed simulation budget. Based on some approximations, we derive an asymptotic closed-form allocation rule which is easy to compute and implement and can help provide more insights about the allocation. The numerical testing shows that our approach can enhance the simulation efficiency.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
