A scalable bounding method for multistage stochastic programs

DOI10.1137/16M1075594MaRDI QIDQ5348474zbMATH OpenOpenAlexWikidataFDO

Authors Burhaneddin Sandıkçı, Osman Y. Özaltın

Publication date 18 August 2017

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/16m1075594

zbMATH Keywords

parallel computingstochastic programmingmixed-integermultistagebounding

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic programming (90C15) Mixed integer programming (90C11) Decomposition methods (49M27) Parallel algorithms in computer science (68W10)

Recommendations

• Bounds and approximations for multistage stochastic programs
• Bound-based decision rules in multistage stochastic programming
• An embarrassingly parallel method for large-scale stochastic programs
• Bounding multi-stage stochastic programs from above
• Bounds in multistage linear stochastic programming

Cites work

• scientific article; zbMATH DE number 1688599 (Why is no real title available?)
• scientific article; zbMATH DE number 5007572 (Why is no real title available?)
• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
• A hierarchy of bounds for stochastic mixed-integer programs
• A scenario decomposition algorithm for 0-1 stochastic programs
• Algorithms for stochastic mixed-integer programming models
• An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
• An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
• Barycentric scenario trees in convex multistage stochastic programming
• Bounds and approximations for multistage stochastic programs
• Bounds in multistage linear stochastic programming
• Cutting planes for multistage stochastic integer programs
• Dual decomposition in stochastic integer programming
• Dynamic capacity acquisition and assignment under uncertainty
• Generalized bounds for convex multistage stochastic programs.
• Inequalities for stochastic linear programming problems
• Introduction to stochastic programming.
• Lectures on stochastic programming. Modeling and theory.
• Monotonic bounds in multistage mixed-integer stochastic programming
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
• New Second-Order Bounds on the Expectation of Saddle Functions with Applications to Stochastic Linear Programming
• On parallelizing dual decomposition in stochastic integer programming
• Optimization-Driven Scenario Grouping
• Optimizing the societal benefits of the annual influenza vaccine: a stochastic programming approach
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
• Scenario Tree Generation for Multi-stage Stochastic Programs
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• Scenario tree modeling for multistage stochastic programs
• Scenario tree reduction for multistage stochastic programs
• Second-Order Lower Bounds on the Expectation of a Convex Function
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• Sublinear upper bounds for stochastic programs with recourse
• The sample average approximation method for stochastic discrete optimization
• The value of the stochastic solution in multistage problems
• The value of the stochastic solution in stochastic linear programs with fixed recourse

Cited in

(18)

• On the number of stages in multistage stochastic programs
• Column-and-constraint generation approach to partition-based risk-averse two-stage stochastic programs
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
• A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW
• Guaranteed bounds for general nondiscrete multistage risk-averse stochastic optimization programs
• Bounds on risk-averse mixed-integer multi-stage stochastic programming problems with mean-CVaR
• A method for solving multi-period stochastic optimization problem based on computer application and multi-cycle stochastic programming
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
• Stochastic dual dynamic integer programming
• Bounds for Multistage Mixed-Integer Distributionally Robust Optimization
• A branch-and-bound method for multistage stochastic integer programs with risk objectives
• Building and solving large-scale stochastic programs on an affordable distributed computing system
• An exact solution approach for risk-averse mixed-integer multi-stage stochastic programming problems
• Optimization-Driven Scenario Grouping
• An embarrassingly parallel method for large-scale stochastic programs
• Multi-stage stochastic programming for demand response optimization
• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
• COVID-19: data-driven optimal allocation of ventilator supply under uncertainty and risk

This page was built for publication: A scalable bounding method for multistage stochastic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348474)