Tree Approximations of Dynamic Stochastic Programs
From MaRDI portal
Recommendations
- Barycentric scenario trees in convex multistage stochastic programming
- Tree approximation for discrete time stochastic processes: a process distance approach
- Dynamic generation of scenario trees
- Scenario tree modeling for multistage stochastic programs
- Epi-Convergent Discretizations of Multistage Stochastic Programs
Cited in
(16)- Bound-based decision rules in multistage stochastic programming
- Tree approximation for discrete time stochastic processes: a process distance approach
- Multi-stage stochastic optimization: the distance between stochastic scenario processes
- Multistage multivariate nested distance: an empirical analysis.
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- An Integrated Transportation Distance between Kernels and Approximate Dynamic Risk Evaluation in Markov Systems
- Epi-Convergent Discretizations of Multistage Stochastic Programs
- Knowledge-based scenario tree generation methods and application in multiperiod portfolio selection problem
- From empirical observations to tree models for stochastic optimization: convergence properties
- GLOBAL CONVERGENCE OF A GENERAL SAMPLING ALGORITHM FOR DYNAMIC NONLINEAR STOCHASTIC PROGRAMS
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
- Dynamic generation of scenario trees
- Stochastic optimization of electricity portfolios: scenario tree modeling and risk management
- Numerical evaluation of approximation methods in stochastic programming
- Incorporating statistical model error into the calculation of acceptability prices of contingent claims
- Scenario Tree Generation for Multi-stage Stochastic Programs
This page was built for publication: Tree Approximations of Dynamic Stochastic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519422)