The decomposition principle and algorithms for linear programming

DOI10.1016/0024-3795(91)90270-7zbMath0729.65042OpenAlexW2072867904WikidataQ114852080 ScholiaQ114852080MaRDI QIDQ806964

N. E. Zubov

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(91)90270-7

zbMATH Keywords

linear programmingNumerical experimentscomputational resultsDantzig-Wolfe decomposition algorithmdecentralized decisionDKN-algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Robust food-energy-water-environmental security management: Stochastic quasigradient procedure for linkage of distributed optimization models under asymmetric information and uncertainty ⋮ Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis

Cites Work

• A new polynomial-time algorithm for linear programming
• The Decomposition Algorithm for Linear Programs
• Mathematics in economics: Achievements, difficulties, perspectives
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item