On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems
From MaRDI portal
Publication:2091214
DOI10.1007/s11590-021-01839-5zbMath1505.90085OpenAlexW4205773039MaRDI QIDQ2091214
Carlos Andrés Gamboa, Alexandre Street, Davi Michel Valladão
Publication date: 1 November 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01839-5
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Implementing bounds-based approximations in convex-concave two-stage stochastic programming
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Robust sample average approximation
- Second-order scenario approximation and refinement in optimization under uncertainty
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
- Introduction to Stochastic Programming
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- The Price of Robustness
- A tight upper bound for the expectation of a convex function of a multivariate random variable
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Solving stochastic programming problems with recourse including error bounds
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems