An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
From MaRDI portal
Publication:1634284
DOI10.1016/j.ejor.2018.10.008zbMath1404.90093OpenAlexW2896669627WikidataQ129100085 ScholiaQ129100085MaRDI QIDQ1634284
Dick den Hertog, Krzysztof Postek, Ward Romeijnders, Maarten H. van der Vlerk
Publication date: 18 December 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://research.rug.nl/en/publications/an-approximation-framework-for-twostage-ambiguous-stochastic-integer-programs-under-meanmad-information(ea4d7e5d-dba5-4c39-9695-02713fc59aa9).html
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total variation bounds on the expectation of periodic functions with applications to recourse approximations
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming
- Stochastic integer programming: general models and algorithms
- Dual decomposition in stochastic integer programming
- Stochastic programming with simple integer recourse
- Scenario reduction in stochastic programming
- Stochastic programming with integer variables
- Convex approximations for complete integer recourse models
- $K$-adaptability in two-stage distributionally robust binary programming
- Scenario reduction algorithms in stochastic programming
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Distributionally robust simple integer recourse
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Computational complexity of stochastic programming problems
- Simple integer recourse models: convexity and convex approximations
- Assessing solution quality in stochastic programs
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
- Distributionally Robust Convex Optimization
- Convex Approximations for Totally Unimodular Integer Recourse Models: A Uniform Error Bound
- Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
- K-Adaptability in Two-Stage Robust Binary Programming
- Lectures on Stochastic Programming
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic Programs with Incomplete Information
- Introduction to Stochastic Programming
- On a Class of Minimax Stochastic Programs
- Minimax analysis of stochastic problems
- Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information
- Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models
- The General Moment Problem, A Geometric Approach
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- More bounds on the expectation of a convex function of a random variable
- A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound
- Scenario tree generation for multiperiod financial optimization of optimal discretization
