The decomposition principle and algorithms for linear programming
From MaRDI portal
The paper deals with the computational difficulties encountered in the Dantzig-Wolfe decomposition algorithm. The DKN-algorithm is proposed. Numerical experiments are given, which illustrate this procedure, and computational results are described. The DKN-algorithm is exemplified by further discussion of the case of decentralized decision.
Recommendations
- Méthodes de décomposition et décentralisation en programmation linéaire
- Interior-point algorithms for Dantzig and Wolfe decomposition principle
- Numerical behavior of LP algorithms based upon the decomposition principle
- scientific article; zbMATH DE number 3912094
- DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
Cites work
- A new polynomial-time algorithm for linear programming
- scientific article; zbMATH DE number 3919689 (Why is no real title available?)
- scientific article; zbMATH DE number 4049374 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3765539 (Why is no real title available?)
- scientific article; zbMATH DE number 193918 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- scientific article; zbMATH DE number 3416582 (Why is no real title available?)
- Mathematics in economics: Achievements, difficulties, perspectives
- The Decomposition Algorithm for Linear Programs
Cited in
(21)- DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
- Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.
- Robust food-energy-water-environmental security management: Stochastic quasigradient procedure for linkage of distributed optimization models under asymmetric information and uncertainty
- Interior-point algorithms for Dantzig and Wolfe decomposition principle
- scientific article; zbMATH DE number 4174661 (Why is no real title available?)
- scientific article; zbMATH DE number 3856807 (Why is no real title available?)
- Computational aspects of DYNAMICO : a model of trade and development in the world economy
- Three-level Decomposition Approach for Solving Feedstock Problems on Microcomputers
- scientific article; zbMATH DE number 3912094 (Why is no real title available?)
- Méthodes de décomposition et décentralisation en programmation linéaire
- Recent advances in the decomposition approach to linear programming
- scientific article; zbMATH DE number 4055369 (Why is no real title available?)
- scientific article; zbMATH DE number 27752 (Why is no real title available?)
- scientific article; zbMATH DE number 177100 (Why is no real title available?)
- scientific article; zbMATH DE number 1203409 (Why is no real title available?)
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- scientific article; zbMATH DE number 2000783 (Why is no real title available?)
- Numerical behavior of LP algorithms based upon the decomposition principle
- Convergence behavior of decomposition algorithms for linear programs
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
This page was built for publication: The decomposition principle and algorithms for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806964)
