Ordinal optimization with computing budget allocation for selecting an optimal subset
DOI10.1142/S0217595916500093zbMATH Open1341.90063MaRDI QIDQ2809316FDOQ2809316
Authors: Mahmoud H. Alrefaei, Mohammad H. Almomani 
Publication date: 27 May 2016
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Recommendations
Management decision making, including multiple objectives (90B50) Decision theory (91B06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Production theory, theory of the firm (91B38)
Cites Work
- Ordinal optimization of DEDS
- Subset selection of best simulated systems
- A Simulation Budget Allocation Procedure for Enhancing the Efficiency of Optimal Subset Selection
- Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems
- A three-stage procedure for selecting a good enough simulated system
Cited In (10)
- Title not available (Why is that?)
- A combined statistical selection procedure measured by the expected opportunity cost
- Convergence rate analysis for optimal computing budget allocation algorithms
- An explanation of ordinal optimization: Soft computing for hard problems
- Integration of indifference-zone with multi-objective computing budget allocation
- Title not available (Why is that?)
- Simulation budget allocation for simultaneously selecting the best and worst subsets
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Using ordinal optimization approach to improve efficiency of selection procedures
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
This page was built for publication: Ordinal optimization with computing budget allocation for selecting an optimal subset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809316)
