A hierarchy of bounds for stochastic mixed-integer programs
From MaRDI portal
Publication:1949254
DOI10.1007/s10107-012-0526-yzbMath1266.90133OpenAlexW3125763446MaRDI QIDQ1949254
Burhaneddin Sandıkçı, Nan Kong, Andrew J. Schaefer
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-0526-y
Mixed integer programming (90C11) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (22)
Bounds in multi-horizon stochastic programs ⋮ Risk-averse hub location: formulation and solution approach ⋮ Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization ⋮ Cluster Lagrangean decomposition in multistage stochastic optimization ⋮ A Scalable Bounding Method for Multistage Stochastic Programs ⋮ On the safe side of stochastic programming: bounds and approximations ⋮ Bounds for Multistage Mixed-Integer Distributionally Robust Optimization ⋮ Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse ⋮ Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs ⋮ Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs ⋮ An Embarrassingly Parallel Method for Large-Scale Stochastic Programs ⋮ Shelter site location under multi-hazard scenarios ⋮ A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems ⋮ Bounds on risk-averse mixed-integer multi-stage stochastic programming problems with mean-CVaR ⋮ The value of the right distribution in stochastic programming with application to a Newsvendor problem ⋮ Constraint generation for risk averse two-stage stochastic programs ⋮ Monotonic bounds in multistage mixed-integer stochastic programming ⋮ Bounds and Approximations for Multistage Stochastic Programs ⋮ Optimization-Driven Scenario Grouping ⋮ Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs ⋮ Two-stage stochastic standard quadratic optimization ⋮ An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
Cites Work
- Unnamed Item
- Improving aggregation bounds for two-stage stochastic programs
- Dynamic capacity acquisition and assignment under uncertainty
- Stochastic linear programming. Models, theory, and computation
- The million-variable ``march for stochastic combinatorial optimization
- Inequalities for Stochastic Linear Programming Problems
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Aggregation bounds in stochastic linear programming
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Bounds for Row-Aggregation in Linear Programming
- The value of the stochastic solution in stochastic linear programs with fixed recourse
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Sharp Bounds on the Value of Perfect Information
- Introduction to Stochastic Programming
- Selection of an optimal subset of sizes
- Solving stochastic programming problems with recourse including error bounds
This page was built for publication: A hierarchy of bounds for stochastic mixed-integer programs