Convex approximations for complete integer recourse models
From MaRDI portal
The author considers the two-stage integer recourse problem. Convex approximations of the expected value function are constructed. This gives an optimal solution for the class of problems with totally unimodular recourse matrix. For the general case the constructed convex approximation is a lower bound for the expected value function. It is proven that the proposed convex approximation is strictly better than the one obtained using the LP relaxation of the second-stage problem.
Recommendations
- Simple integer recourse models: convexity and convex approximations
- Convex approximations for a class of mixed-integer recourse models
- Assessing the quality of convex approximations for two-stage totally unimodular integer recourse models
- scientific article; zbMATH DE number 1031417
- Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
Cites work
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1241478 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 1031417 (Why is no real title available?)
- Introduction to Stochastic Programming
- On optimal allocation of indivisibles under uncertainty
- On the convex hull of the simple integer recourse objective function
- Simple integer recourse models: convexity and convex approximations
- Stochastic integer programming: general models and algorithms
- Stochastic programming with simple integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
Cited in
(28)- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- On the convex hull of the simple integer recourse objective function
- Totally unimodular stochastic programs
- An ALM model for pension funds using integrated chance constraints
- Convex approximations for a class of mixed-integer recourse models
- The stochastic programming heritage of Maarten van der Vlerk
- Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations
- Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
- On multiple simple recourse models
- Exact solutions to a class of stochastic generalized assignment problems
- Simple integer recourse models: convexity and convex approximations
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Integer set reduction for stochastic mixed-integer programming
- Total variation bounds on the expectation of periodic functions with applications to recourse approximations
- Convex approximations for totally unimodular integer recourse models: a uniform error bound
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning
- Pseudo-valid cutting planes for two-stage mixed-integer stochastic programs with right-hand-side uncertainty
- Erratum to: Convex approximations for complete integer recourse models
- scientific article; zbMATH DE number 1031417 (Why is no real title available?)
- Assessing the quality of convex approximations for two-stage totally unimodular integer recourse models
- Simplification of recourse models by modification of recourse data
- Robust optimization of sums of piecewise linear functions with application to inventory problems
- A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound
- Convex approximations of two-stage risk-averse mixed-integer recourse models
- Integrated chance constraints: reduced forms and an algorithm
This page was built for publication: Convex approximations for complete integer recourse models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434075)