Aggregation and discretization in multistage stochastic programming
From MaRDI portal
Recommendations
- Primal-Dual Aggregation and Disaggregation for Stochastic Linear Programs
- Numerical study of discretizations of multistage stochastic programs
- Aggregation bounds in stochastic linear programming
- On the number of stages in multistage stochastic programs
- Bounds and approximations for multistage stochastic programs
Cites work
- scientific article; zbMATH DE number 3874941 (Why is no real title available?)
- scientific article; zbMATH DE number 3961349 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 176392 (Why is no real title available?)
- scientific article; zbMATH DE number 622005 (Why is no real title available?)
- scientific article; zbMATH DE number 1076783 (Why is no real title available?)
- scientific article; zbMATH DE number 1487998 (Why is no real title available?)
- scientific article; zbMATH DE number 824994 (Why is no real title available?)
- scientific article; zbMATH DE number 3394474 (Why is no real title available?)
- A tight upper bound for the expectation of a convex function of a multivariate random variable
- Aggregation bounds in stochastic linear programming
- An upper bound for SLP using first and total second moments
- Barycentric scenario trees in convex multistage stochastic programming
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
- Conditional independence for statistical operations
- EVPI-based importance sampling solution procedures for multistage stochastic linear programmes on parallel MIMD architectures
- Evaluation of scenario generation methods for stochastic programming
- Existence Results and Finite Horizon Approximates for Infinite Horizon Optimization Problems
- Generalized bounds for convex multistage stochastic programs.
- Generating scenario trees for multistage decision problems
- Inequalities for stochastic linear programming problems
- Introduction to Stochastic Programming
- Markov chains and stochastic stability
- Multistage stochastic programming: Error analysis for the convex case
- On complexity of multistage stochastic programs
- On complexity of stochastic programming problems
- Primal-Dual Aggregation and Disaggregation for Stochastic Linear Programs
- Quantitative Stability in Stochastic Programming: The Method of Probability Metrics
- Scenario reduction algorithms in stochastic programming
- Scenario reduction in stochastic programming
- Scenario tree generation for multiperiod financial optimization of optimal discretization
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic quasigradient methods for optimization of discrete event systems
- Stochastic two-stage programming
- The Optimal Recourse Problem in Discrete Time: L^1 -Multipliers for Inequality Constraints
- The Scenario Generation Algorithm for Multistage Stochastic Linear Programming
- Theory of statistics
- Valuation of electricity swing options by multistage stochastic programming
Cited in
(28)- An information-based approximation scheme for stochastic optimization problems in continuous time
- Bound-based decision rules in multistage stochastic programming
- Two-stage stochastic standard quadratic optimization
- Technical Note—Waterfall and Agile Product Development Approaches: Disjunctive Stochastic Programming Formulations
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- scientific article; zbMATH DE number 4008089 (Why is no real title available?)
- Scenario Reduction Techniques in Stochastic Programming
- Epi-convergent discretizations of multistage stochastic programs via integration quadratures
- The value of the right distribution in stochastic programming with application to a Newsvendor problem
- Guaranteed bounds for general nondiscrete multistage risk-averse stochastic optimization programs
- Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management
- On the safe side of stochastic programming: bounds and approximations
- scientific article; zbMATH DE number 56356 (Why is no real title available?)
- Scenario tree reduction for multistage stochastic programs
- Bounds in multi-horizon stochastic programs
- Multistage stochastic portfolio optimisation in deregulated electricity markets using linear decision rules
- Monotonic bounds in multistage mixed-integer stochastic programming
- Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times
- An effective heuristic for multistage linear programming with a stochastic right-hand side
- Convergent bounds for stochastic programs with expected value constraints
- Dynamic generation of scenario trees
- Bounds for Multistage Mixed-Integer Distributionally Robust Optimization
- Primal-dual constraint aggregation with application to stochastic programming
- Reduced cost-based variable fixing in two-stage stochastic programming
- Bounds and approximations for multistage stochastic programs
- scientific article; zbMATH DE number 7733435 (Why is no real title available?)
- Discrete Multistage Optimization and Hierarchical Market
- Numerical study of discretizations of multistage stochastic programs
This page was built for publication: Aggregation and discretization in multistage stochastic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476988)
