Two stage linear programming under uncertainty with 0–1 integer first stage variables
From MaRDI portal
Publication:3885534
DOI10.1007/BF01581648zbMath0442.90076MaRDI QIDQ3885534
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
enumerationcontinuous variablescapital investmentstochastic programsBenders' partitioning algorithmcoal transportation problemnetwork investment applicationtwo stage linear programs under uncertainty
Related Items
A two-stage stochastic integer programming model for a thermal power system expansion ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Minimizing a stochastic maximum-reliability path ⋮ Risk-averse formulations and methods for a virtual power plant ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ Adaptive cultural algorithm-based cuckoo search for time-dependent vehicle routing problem with stochastic customers using adaptive fractional Kalman speed prediction ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ A decomposition approach for solving a broadcast domination network design problem ⋮ Two‐stage stochastic integer programming: a survey ⋮ The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ The integer \(L\)-shaped method for stochastic integer programs with complete recourse ⋮ Measuring and maximizing resilience of freight transportation networks ⋮ An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs ⋮ Exact solutions to a class of stochastic generalized assignment problems ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables ⋮ Modeling supplier selection and the use of option contracts for global supply chain design ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing ⋮ The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification ⋮ A nonlinear bilevel model for analysis of electric utility demand-side planning issues
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- The Cutting-Plane Method for Solving Convex Programs
- Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- An Improved Implicit Enumeration Approach for Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
