Duality and statistical tests of optimality for two stage stochastic programs
From MaRDI portal
Publication:1363429
DOI10.1007/BF02592155zbMath0874.90146MaRDI QIDQ1363429
Publication date: 7 August 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Predictive stochastic programming, Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming, Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction, Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation, Simulation-Based Optimality Tests for Stochastic Programs, Variance reduction for sequential sampling in stochastic programming, Estimation of optimality gap using stratified sampling, A stochastic soft constraints fuzzy model for a portfolio selection problem, Event tree based sampling, Optimality functions in stochastic programming, Assessing solution quality in stochastic programs, Multistage stochastic convex programs: duality and its implications, The empirical behavior of sampling methods for stochastic programming, A simulation-based approach to two-stage stochastic programming with recourse, Monte Carlo bounding techniques for determinig solution quality in stochastic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel processors for planning under uncertainty
- Partitioning procedures for solving mixed-variables programming problems
- Statistical verification of optimality conditions for stochastic programs with recourse
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Stochastic convex programming: Singular multipliers and extended duality, singular multipliers and duality
- Bootstrap methods: another look at the jackknife
- Finite master programs in regularized stochastic decomposition
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Aggregation bounds in stochastic linear programming
- Optimization and nonsmooth analysis
- A regularized decomposition method for minimizing a sum of polyhedral functions
- On stochastic programming ii: dynamic problems under risk∗
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Bounds for Row-Aggregation in Linear Programming
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization
- Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
- A dual strategy for the implementation of the aggregation principle in decision making under uncertainty
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- Convex Analysis
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming