Simulation-based confidence bounds for two-stage stochastic programs
From MaRDI portal
Publication:1949266
DOI10.1007/s10107-012-0621-0zbMath1286.90101OpenAlexW2156629950MaRDI QIDQ1949266
Publication date: 6 May 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0621-0
Linear programming (90C05) Stochastic programming (90C15) Probability theory (educational aspects) (97K50)
Related Items
Predictive stochastic programming, Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming, Sequential Bounding Methods for Two-Stage Stochastic Programs, Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction, Variance reduction for sequential sampling in stochastic programming, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, Estimating the Probability that a Function Observed with Noise Is Convex, Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel processors for planning under uncertainty
- Enhancements of two-stage stochastic decomposition
- Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- Statistical approximations for stochastic linear programming problems
- A simulation-based approach to two-stage stochastic programming with recourse
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Finite master programs in regularized stochastic decomposition
- Cut sharing for multistage stochastic linear programs with interstage dependency
- Conditioning of convex piecewise linear stochastic programs
- Assessing solution quality in stochastic programs
- The empirical behavior of sampling methods for stochastic programming
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Stochastic simulation: Algorithms and analysis
- On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
- Linear Programming under Uncertainty
- A Probabilistic Lower Bound for Two-Stage Stochastic Programs
- Simulation-Based Optimality Tests for Stochastic Programs
- Importance Sampling for Stochastic Simulations
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Epi‐consistency of convex stochastic programs
- On the continuity of the value of a linear program and of related polyhedral-valued multifunctions
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Formulating Two-Stage Stochastic Programs for Interior Point Methods
- Monte Carlo sampling approach to stochastic programming
- Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming
- Analysis of Sample-Path Optimization
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
