Sample approximation technique for mixed-integer stochastic programming problems with expected value constraints
From MaRDI portal
Publication:2448164
DOI10.1007/s11590-013-0642-5zbMath1317.90215OpenAlexW2030522578WikidataQ105583493 ScholiaQ105583493MaRDI QIDQ2448164
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0642-5
rate of convergenceconditional value at risksample approximationnon-iid samplingexpected value constrained problemsHölder-calmness
Related Items (2)
Solving equilibrium standby redundancy optimization problem by hybrid PSO algorithm ⋮ Mean-value at risk portfolio efficiency: approaches based on data envelopment analysis models with negative data and their empirical behaviour
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
- Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
- Integrated chance constraints: reduced forms and an algorithm
- Sample average approximation of expected value constrained stochastic programs
- Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming
- Sample average approximation method for chance constrained programming: Theory and applications
- Large deviations techniques and applications.
- Duality in stochastic linear and dynamic programming
- Approximation and contamination bounds for probabilistic programs
- Robustness in stochastic programs with risk constraints
- Diversification-consistent data envelopment analysis with general deviation measures
- Some large deviations results for Latin hypercube sampling
- On relations between chance constrained and penalty function problems under discrete distributions
- Stochastic programming problems with generalized integrated chance constraints
- On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Variational Analysis
- Optimization with Stochastic Dominance Constraints
- Convergence properties of two-stage stochastic programming
This page was built for publication: Sample approximation technique for mixed-integer stochastic programming problems with expected value constraints
