On complexity of multistage stochastic programs
From MaRDI portal
Publication:2583700
DOI10.1016/J.ORL.2005.02.003zbMath1080.90056OpenAlexW2064227123MaRDI QIDQ2583700
Publication date: 18 January 2006
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.02.003
complexitystochastic programmingMonte Carlo samplingsample average methodlarge deviations exponential bounds
Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15)
Related Items (43)
Robust and reliable portfolio optimization formulation of a chance constrained problem ⋮ Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming ⋮ A framework for adaptive open-pit mining planning under geological uncertainty ⋮ Particle methods for stochastic optimal control problems ⋮ Online spatio-temporal matching in stochastic and dynamic domains ⋮ An effective heuristic for multistage linear programming with a stochastic right-hand side ⋮ Risk exposure and Lagrange multipliers of nonanticipativity constraints in multistage stochastic problems ⋮ On complexity of multistage stochastic programs under heavy tailed distributions ⋮ Unnamed Item ⋮ Analysis of stochastic dual dynamic programming method ⋮ MIDAS: a mixed integer dynamic approximation scheme ⋮ A composite risk measure framework for decision making under uncertainty ⋮ A note on sample complexity of multistage stochastic programs ⋮ Compromise policy for multi-stage stochastic linear programming: variance and bias reduction ⋮ Multistage stochastic portfolio optimisation in deregulated electricity markets using linear decision rules ⋮ Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization ⋮ Monotonicity and complexity of multistage stochastic variational inequalities ⋮ Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion ⋮ Confidence level solutions for stochastic programming ⋮ Unnamed Item ⋮ Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs ⋮ Massively parallel processing of recursive multi-period portfolio models ⋮ Asymptotics of minimax stochastic programs ⋮ Aggregation and discretization in multistage stochastic programming ⋮ An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization ⋮ Dynamic stochastic approximation for multi-stage stochastic optimization ⋮ A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract ⋮ Some large deviations results for Latin hypercube sampling ⋮ Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method ⋮ Decomposition of large-scale stochastic optimal control problems ⋮ Stochastic decomposition applied to large-scale hydro valleys management ⋮ Optimizing power generation in the presence of micro-grids ⋮ Stochastic programming approach to optimization under uncertainty ⋮ Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns ⋮ A stochastic gradient type algorithm for closed-loop problems ⋮ Scenario tree modeling for multistage stochastic programs ⋮ Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models ⋮ Convergence analysis of sample average approximation for a class of stochastic nonlinear complementarity problems: from two-stage to multistage ⋮ Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies ⋮ Convergent bounds for stochastic programs with expected value constraints ⋮ Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach ⋮ Complexity of stochastic dual dynamic programming ⋮ A stability result for linear Markovian stochastic optimization problems
Uses Software
Cites Work
- Unnamed Item
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Inference of statistical bounds for multistage stochastic programming problems
- The sample average approximation method applied to stochastic routing problems: a computational study
- The empirical behavior of sampling methods for stochastic programming
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Monte Carlo sampling approach to stochastic programming
This page was built for publication: On complexity of multistage stochastic programs