EVPI-based importance sampling solution procedures for multistage stochastic linear programmes on parallel MIMD architectures

DOI10.1023/A:1018956530304zbMATH Open0937.90075OpenAlexW3121641478MaRDI QIDQ1808191FDOQ1808191

Authors: R. T. Thompson, M. A. H. Dempster 

Publication date: 2 December 1999

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

Full work available at URL: https://doi.org/10.1023/a:1018956530304

Recommendations

• Parallelization and aggregation of nested Benders decomposition
• A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
• On a distributed implementation of a decomposition method for multistage linear stochastic programs
• scientific article; zbMATH DE number 1163102
• Scalable parallel Benders decomposition for stochastic linear programming

zbMATH Keywords

aggregationlinear programmingnested Benders decompositionparallel algorithmsMIMD computersdynamic stochastic programming

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Stochastic programming (90C15)

Cited In (22)

• A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning
• Measuring risk for income streams
• Solution sensitivity-based scenario reduction for stochastic unit commitment
• Importance sampling in stochastic optimization: an application to intertemporal portfolio choice
• Knowledge-based scenario tree generation methods and application in multiperiod portfolio selection problem
• An approach to the valuation and decision of ERP investment projects based on real options
• Modelling and analysis of multistage stochastic programming problems: A software environment
• Investment and the dynamic cost of income uncertainty: the case of diminishing expectations in agriculture
• Parallel processors for planning under uncertainty
• A moment-matching method to generate arbitrage-free scenarios
• Path-dependent scenario trees for multistage stochastic programmes in finance
• Solving ALM problems via sequential stochastic programming
• EVPI
• Aggregation and discretization in multistage stochastic programming
• Epi-convergent discretizations of stochastic programs via integration quadratures
• Sequential importance sampling algorithms for dynamic stochastic programming
• Convergent bounds for stochastic programs with expected value constraints
• Schumann, a modeling framework for supply chain management under uncertainty
• Scenario generation for stochastic optimization problems via the sparse grid method
• A stochastic integer programming approach to air traffic scheduling and operations
• CORO, a modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty
• Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method

Uses Software

• MSLiP

This page was built for publication: EVPI-based importance sampling solution procedures for multistage stochastic linear programmes on parallel MIMD architectures

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