Aggregation and decomposition for multi-divisional linear programs

DOI10.1016/0377-2217(94)90339-5zbMath0798.90098OpenAlexW2022076666MaRDI QIDQ1319577

Rainer Leisten, Kurt O. Jørnsten

Publication date: 12 April 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90339-5

zbMATH Keywords

aggregationdecentralizationtwo-level organizationcentral planning

Mathematics Subject Classification ID

Linear programming (90C05) Hierarchical systems (93A13)

Related Items

Weights improvement in column aggregation ⋮ Decomposition and iterative aggregation in hierarchical and decentralised planning structures ⋮ Distributed decision making----a unified approach.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local decomposition methods for linear programming
• Mathematical programming with iterative aggregation
• Decomposition-aggregation method for convex programming problems
• A global convergence theorem for aggregation algorithms
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems
• A note on mixed procedures for decomposing linear programming problems
• An algorithm of feasible directions for the aggregation problem
• Two-Level Planning