Efficient subset selection for the expected opportunity cost
From MaRDI portal
Publication:894325
DOI10.1016/j.automatica.2015.06.005zbMath1326.93083OpenAlexW2145286212MaRDI QIDQ894325
Publication date: 30 November 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2015.06.005
subset selectionsimulation optimizationbudget allocationopportunity costoptimal computing budget allocation (OCBA)
Convex programming (90C25) Discrete event control/observation systems (93C65) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (8)
Robust ranking and selection with optimal computing budget allocation ⋮ Simulation budget allocation for simultaneously selecting the best and worst subsets ⋮ An efficient simulation procedure for the expected opportunity cost using metamodels ⋮ Asymptotic optimality of myopic ranking and selection procedures ⋮ Convergence rate analysis for optimal computing budget allocation algorithms ⋮ A New Budget Allocation Framework for the Expected Opportunity Cost ⋮ An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints ⋮ Efficient simulation budget allocation for subset selection using regression metamodels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The transform likelihood ratio method for rare event simulation with heavy tails
- A model reference adaptive search method for stochastic global optimization
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Selecting the Best Simulated Design With the Expected Opportunity Cost Bound
- A Model Reference Adaptive Search Method for Global Optimization
- A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation
- On two-stage selection procedures and related probability-inequalities
- A fully sequential procedure for indifference-zone selection in simulation
- Selection Procedures with Frequentist Expected Opportunity Cost Bounds
This page was built for publication: Efficient subset selection for the expected opportunity cost