Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs - MaRDI portal

Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs

From MaRDI portal
Publication:4530640

DOI10.1287/opre.48.1.91.12450zbMath1106.90363OpenAlexW2031451726MaRDI QIDQ4530640

John R. Birge, Samer Takriti

Publication date: 4 June 2002

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

Full work available at URL: https://doi.org/10.1287/opre.48.1.91.12450




Related Items (25)

Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problemsOn a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programmingBFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problemsA multi-step rolled forward chance-constrained model and a proactive dynamic approach for the wheat crop quality control problemStochastic programming for qualification management of parallel machines in semiconductor manufacturingTwo-stage stochastic programming supply chain model for biodiesel production via wastewater treatmentAn exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspectsOn a stochastic sequencing and scheduling problemOn the enrouting protocol problem under uncertaintyStochastic dual dynamic integer programmingFrom scenarios to conditional scenarios in two‐stage stochastic MILP problemsLagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problemsBFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.Structuring Bilateral Energy Contract Portfolios in Competitive MarketsShort-term hydropower production planning by stochastic programmingDynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problemA two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemesA stochastic production planning problem with nonlinear costDuality gaps in nonconvex stochastic optimizationStochastic set packing problemA management system for decompositions in stochastic programmingA Progressive Hedging Approach for Surgery Planning Under UncertaintyTwo-stage network constrained robust unit commitment problemA general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problemsAbout Lagrangian methods in integer optimization




This page was built for publication: Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs