Applying the progressive hedging algorithm to stochastic generalized networks

DOI10.1007/BF02204860zbMath0734.90033OpenAlexW2027041028MaRDI QIDQ811327

John M. Mulvey, Hercules Vladimirou

Publication date: 1991

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02204860

zbMATH Keywords

decompositionprogressive hedging algorithmscenario analysisdynamic decision problemsmulti-scenario generalized networks

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (31)

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs ⋮ Parallelizable preprocessing method for multistage stochastic programming problems ⋮ On the use of optimization models for portfolio selection: A review and some computational results ⋮ Scenario analysis via bundle decomposition ⋮ Barycentric scenario trees in convex multistage stochastic programming ⋮ Multistage stochastic programming: Error analysis for the convex case ⋮ Solving multistage stochastic network programs on massively prallel computers ⋮ An ADMM algorithm for two-stage stochastic programming problems ⋮ A classification of methods for distributed system optimization based on formulation structure ⋮ A stochastic programming approach for chemotherapy appointment scheduling ⋮ Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ Stochastic forestry planning under market and growth uncertainty ⋮ Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems ⋮ Managing congestion in a multi-modal transportation network under biomass supply uncertainty ⋮ An Embarrassingly Parallel Method for Large-Scale Stochastic Programs ⋮ A progressive hedging method for the optimization of social engagement and opportunistic IoT problems ⋮ A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs ⋮ A stochastic multi-agent optimization model for energy infrastructure planning under uncertainty in an oligopolistic market ⋮ A diagonal quadratic approximation method for large scale linear programs ⋮ On the implementation of a log-barrier progressive hedging method for multistage stochastic programs ⋮ Scenario aggregation for supply chain quantity-flexibility contract ⋮ Solving stochastic transportation network protection problems using the progressive hedging-based method ⋮ Dynamic portfolio optimization: time decomposition using the maximum principle with a scenario approach ⋮ A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming ⋮ Scheduled service network design with quality targets and stochastic travel times ⋮ A splitting method for stochastic programs ⋮ A Progressive Hedging Approach for Surgery Planning Under Uncertainty ⋮ Strategic financial risk management and operations research ⋮ Using scenario trees and progressive hedging for stochastic inventory routing problems ⋮ Multi-stage stochastic linear programs for portfolio optimization

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel processors for planning under uncertainty
• Computational experience with a primal-dual interior point method for linear programming
• Stochastic network optimization models for investment planning
• Refining bounds for stochastic linear programs with linearly transformed independent random variables
• Cluster Analysis: An Application of Lagrangian Relaxation
• Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
• Solving stochastic programs with simple recourse
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• Solving stochastic programs with network recourse
• OR Practice—Large-Scale Nonlinear Network Models and Their Application
• Solving multistage stochastic networks: An application of scenario aggregation
• Formulating Two-Stage Stochastic Programs for Interior Point Methods
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

This page was built for publication: Applying the progressive hedging algorithm to stochastic generalized networks