Local decomposition methods for linear programming
This paper deals with yet another method for solving a number of linear programming problems that are linked by common constraints. The Dantzig- Wolfe technique and Benders' method for solving this class of problems are well-known. Two methods are proposed, one for linear programming problems linked by common constraints, which is called dual local decomposition method, and one for problems linked by common variables, called the primal local decomposition method. The main feature of these methods is that parametric solutions to the subproblems are interacting with the principal problem. According to the author the efficiency of the method will depend to a large extent on the problem structure which will determine how many subproblems are included into the principal problem in the course of the iterations.
- An efficient decomposition method for linear programming problems
- On the parallel use of the decomposition method in a pair of dual problems of linear programming
- On the decomposition of linear programming problems with connecting constraints and variables
- An Implementation Of The Dual Local Decomposition Method
- scientific article; zbMATH DE number 3858840
- A dual decomposition method for block-diagonal linear programs
- Decomposition of Linear Programs by Direct Distribution
- Experiences in Using a Decomposition Program
- scientific article; zbMATH DE number 3819432 (Why is no real title available?)
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3402327 (Why is no real title available?)
- Partitioning procedures for solving mixed-variables programming problems
- The Decomposition Algorithm for Linear Programs
- On the parallel use of the decomposition method in a pair of dual problems of linear programming
- Aggregation and decomposition for multi-divisional linear programs
- Decomposition and iterative aggregation in hierarchical and decentralised planning structures
- Efficient implementation of the localized orthogonal decomposition method
- Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework
- On the decomposition of linear programming problems with connecting constraints and variables
- A decomposition method in linear programming.
- scientific article; zbMATH DE number 3856807 (Why is no real title available?)
- scientific article; zbMATH DE number 3858840 (Why is no real title available?)
- An Implementation Of The Dual Local Decomposition Method
- scientific article; zbMATH DE number 4139478 (Why is no real title available?)
- scientific article; zbMATH DE number 4149896 (Why is no real title available?)
- Méthodes de décomposition et décentralisation en programmation linéaire
- A Parametric Subproblem for Dual Methods in Decomposition
- scientific article; zbMATH DE number 4023014 (Why is no real title available?)
- Dynamic decomposition method for linear programming problems with ceneralized upper bounds
- An efficient decomposition method for linear programming problems
This page was built for publication: Local decomposition methods for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091939)
