Optimal computing budget allocation to select Pareto set under stochastic constraints
From MaRDI portal
Cites work
- A Knowledge-Gradient Policy for Sequential Information Collection
- A Partition-Based Random Search for Stochastic Constrained Optimization via Simulation
- An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints
- Approximate Simulation Budget Allocation for Selecting the Best Design in the Presence of Stochastic Constraints
- Combining multiple criteria analysis, mathematical programming and Monte Carlo simulation to tackle uncertainty in research and development project portfolio selection: a case study from Greece
- Convergence rate analysis for optimal computing budget allocation algorithms
- Efficient Computing Budget Allocation for Simulation-Based Optimization With Stochastic Simulation Time
- Efficient Feasibility Determination With Multiple Performance Measure Constraints
- Efficient subset selection for the expected opportunity cost
- Finding feasible systems in the presence of constraints on multiple performance measures
- MO\(^{2}\)TOS: multi-fidelity optimization with ordinal transformation and optimal sampling
- Multi-objective portfolio optimization considering the dependence structure of asset returns
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
- Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem
- On the convergence rates of expected improvement methods
- On two-stage selection procedures and related probability-inequalities
- Optimal computing budget allocation for the vector evaluated genetic algorithm in multi-objective simulation optimization
- Optimal Computing Budget Allocation to Select the Nondominated Systems—A Large Deviations Perspective
- Pareto set estimation with guaranteed probability of correct selection
- Ranking and Selection as Stochastic Control
- Robust ranking and selection with optimal computing budget allocation
- Sequential sampling to myopically maximize the expected value of information
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Simulation Budget Allocation for Selecting the Top-m Designs With Input Uncertainty
- Supervisor reduction for discrete-event systems
This page was built for publication: Optimal computing budget allocation to select Pareto set under stochastic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288459)