An improved L-shaped method for solving process flexibility design problems
From MaRDI portal
Publication:1793161
DOI10.1155/2016/4329613zbMath1400.90163OpenAlexW2513703801WikidataQ59131302 ScholiaQ59131302MaRDI QIDQ1793161
Huasheng Yang, Li Zheng, Lina Yu, Jatinder N. D. Gupta
Publication date: 12 October 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/4329613
Cites Work
- Unnamed Item
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- Stochastic programming approach to process flexibility design
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- On range and response: dimensions of process flexibility
- Practical enhancements to the Magnanti-Wong method
- Enhancements of two-stage stochastic decomposition
- A multicut algorithm for two-stage stochastic linear programs
- A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
- Decomposition methods in stochastic programming
- Decomposition algorithms for stochastic programming on a computational grid
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- New variants of bundle methods
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- On generating maximal nondominated Benders cuts
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- Characterizing the performance of process flexibility structures
- Solving two-stage stochastic programming problems with level decomposition
- A stochastic programming approach for supply chain network design under uncertainty
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints
- Process Flexibility Revisited: The Graph Expander and Its Applications
- Accelerating Benders Decomposition by Local Branching
- Introduction to Stochastic Programming
- Design for Process Flexibility: Efficiency of the Long Chain and Sparse Structure
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
- Process Flexibility in Supply Chains
- Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations
- Vertical Flexibility in Supply Chains
- Modeling and analysis of flexible queueing systems
- Nested Benders decomposition and dynamic programming for reservoir optimisation
- Worst-Case Analysis of Process Flexibility Designs
- Process Flexibility: A Distribution-Free Bound on the Performance of k-Chain
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Principles on the Benefits of Manufacturing Process Flexibility
- Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility
- Distributed Subgradient Methods for Multi-Agent Optimization
- An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Sparse Process Flexibility Designs: Is the Long Chain Really Optimal?
