Sample average approximation of expected value constrained stochastic programs
From MaRDI portal
Recommendations
- Sample average approximation of stochastic dominance constrained programs
- Sample approximation technique for mixed-integer stochastic programming problems with expected value constraints
- Sample average approximation method for compound stochastic optimization problems
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- Sample average approximation method for chance constrained programming: Theory and applications
Cites work
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- An introduction to the theory of large deviations
- Call center staffing with simulation and cutting plane methods
- Duality in stochastic linear and dynamic programming
- Handling CVaR objectives and constraints in two-stage stochastic models
- Sample average approximation of expected value constrained stochastic programs
- Statistical approximations for recourse constrained stochastic programs
- The sample average approximation method for stochastic discrete optimization
Cited in
(59)- On feasibility of sample average approximation solutions
- Stochastic programming problems with generalized integrated chance constraints
- On sample average approximation for two-stage stochastic programs without relatively complete recourse
- Iterative estimation maximization for stochastic linear programs with conditional value-at-risk constraints
- A simulation optimization approach for a two-echelon inventory system with service level constraints
- Overlapping batches for the assessment of solution quality in stochastic programs
- Mean-value at risk portfolio efficiency: approaches based on data envelopment analysis models with negative data and their empirical behaviour
- Algorithms for stochastic optimization with function or expectation constraints
- Sample average approximation of stochastic dominance constrained programs
- Modeling stochastic dominance as infinite-dimensional constraint systems via the Strassen theorem
- Sample average approximation method for compound stochastic optimization problems
- Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation
- Asymptotic behavior of solutions: an application to stochastic NLP
- The empirical likelihood approach to quantifying uncertainty in sample average approximation
- Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints
- Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming
- Sample average approximation of expected value constrained stochastic programs
- The minimum spanning \(k\)-core problem with bounded CVaR under probabilistic edge failures
- Sample average approximation for risk-averse problems: a virtual power plant scheduling application
- A provisioning problem with stochastic payments
- An asymptotically optimal strategy for constrained multi-armed bandit problems
- Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging
- Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system
- Minimizing conditional-value-at-risk for stochastic scheduling problems
- A central limit theorem and hypotheses testing for risk-averse stochastic programs
- Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
- A smoothing function approach to joint chance-constrained programs
- General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension
- Sample average approximation method for chance constrained programming: Theory and applications
- Nonasymptotic upper estimates for errors of the sample average approximation method to solve risk averse stochastic programs
- Optimality functions in stochastic programming
- A composite risk measure framework for decision making under uncertainty
- Convex stochastic fluid programs with average cost.
- Stochastic optimization problems with CVaR risk measure and their sample average approximation
- On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling
- Data-driven tuning for chance constrained optimization: analysis and extensions
- Conditional value‐at‐risk beyond finance: a survey
- Sample average approximation for stochastic programming with equality constraints
- An index-based deterministic convergent optimal algorithm for constrained multi-armed bandit problems
- Sample approximation technique for mixed-integer stochastic programming problems with expected value constraints
- Reformulations of input-output oriented DEA tests with diversification
- Advances and applications of chance-constrained approaches to systems optimisation under uncertainty
- Confidence-based reasoning in stochastic constraint programming
- Stochastic multiobjective optimization: Sample average approximation and applications
- First order asymptotics of the sample average approximation method to solve risk averse stochastic programs
- Sleeping experts and bandits approach to constrained Markov decision processes
- The sample average approximation method for stochastic discrete optimization
- A probability constrained dynamic switching optimization method for the energy dispatch strategy of hybrid power systems with renewable energy resources and uncertainty
- Robustness in stochastic programs with risk constraints
- Variance reduction in sample approximations of stochastic programs
- Multi-resource allocation in stochastic project scheduling
- Sample average approximations of strongly convex stochastic programs in Hilbert spaces
- Monte Carlo methods for mean-risk optimization and portfolio selection
- Asymptotic analysis of sample average approximation for stochastic optimization problems with joint chance constraints via conditional value at risk and difference of convex functions
- Recovering best statistical guarantees via the empirical divergence-based distributionally robust optimization
- Nonlinear stochastic programming involving \textit{CVaR} in the objective and constraints
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- On relations between chance constrained and penalty function problems under discrete distributions
- Aspects of optimization with stochastic dominance
This page was built for publication: Sample average approximation of expected value constrained stochastic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q957332)
