Local decomposition methods for linear programming

DOI10.1016/S0377-2217(87)80180-7zbMath0623.90053OpenAlexW2165970447MaRDI QIDQ1091939

Cornelis van de Panne

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(87)80180-7

zbMATH Keywords

parametric solutionscommon constraintsdual local decompositionlinked problemsprimal local decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items

Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework, Decomposition and iterative aggregation in hierarchical and decentralised planning structures, Aggregation and decomposition for multi-divisional linear programs

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• The Decomposition Algorithm for Linear Programs
• Experiences in Using a Decomposition Program
• A dual decomposition method for block-diagonal linear programs
• Decomposition of Linear Programs by Direct Distribution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item