Decomposition and iterative aggregation in hierarchical and decentralised planning structures
DOI10.1016/0377-2217(95)00065-XzbMath0902.90110OpenAlexW2044046845MaRDI QIDQ1390198
Rainer Leisten, Kurt O. Jørnsten
Publication date: 14 July 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00065-x
decompositiondecentralizationhierarchical planninglarge-scale programmingaggregation and disaggregationblock-angular LP-modelorganisational problem
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Theory of organizations, manpower planning in operations research (90B70)
Related Items (1)
Cites Work
- Unnamed Item
- 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
- Aggregation and decomposition for multi-divisional linear programs
- Hierarchical structures in organizations: A conceptual framework
- The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation
- Decomposition-aggregation method for convex programming problems
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Decentralization for Multidivision Enterprises
- 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
- Technical Note—Improved Bounds for Aggregated Linear Programs
- A note on mixed procedures for decomposing linear programming problems
- Gradient schemes in iterative aggregation procedures for variable-aggregated lp-problems
- Two-Level Planning
This page was built for publication: Decomposition and iterative aggregation in hierarchical and decentralised planning structures
