Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition

DOI10.1007/s13675-015-0038-7zbMath1329.90163OpenAlexW566649947MaRDI QIDQ904957

Jan Wolf, Ulf Lorenz

Publication date: 14 January 2016

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-015-0038-7

zbMATH Keywords

nested Benders decompositionoptimization under uncertaintyquantified linear programminggame-tree search

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Multistage robust discrete optimization via quantified integer programming, The Benders decomposition algorithm: a literature review

Uses Software

• MSLiP

Cites Work

• Unnamed Item
• Unnamed Item
• MSLiP: A computer code for the multistage stochastic linear programming problem
• Games against nature
• A multicut algorithm for two-stage stochastic linear programs
• Partitioning procedures for solving mixed-variables programming problems
• An analysis of alpha-beta pruning
• Parallelization and aggregation of nested Benders decomposition
• A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
• Stochastic programming with integer variables
• Robust solutions of linear programming problems contaminated with uncertain data
• Game tree algorithms and solution trees
• Parallel decomposition of multistage stochastic programming problems
• Robust optimization-methodology and applications
• On a decision procedure for quantified linear programs
• Computational complexity of stochastic programming problems
• Chance-Constrained Programming
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Solution Techniques for Quantified Linear Programs and the Links to Gaming
• Quantified Linear Programs: A Computational Study
• Approximation in stochastic scheduling
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Polyhedral and Algorithmic Properties of Quantified Linear Programs
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Introduction to Stochastic Programming
• Automated Reasoning
• Approximation in Preemptive Stochastic Online Scheduling