In large and complicated management systems, solutions with the same indices, but with different degrees of aggregation, are used and coordinated. For example, in hierarchical systems, those in higher management levels make decisions with more aggregated indices than those in lower management levels. Managers of an individual subsystem within a large and complicated system use detailed information about their own subsystem and aggregated information (in some degree or other) about other subsystems. The principal idea of the iterative aggregation method is to consecutively recompute the aggregated indices characterizing the activities of the whole system, followed by a recomputation of the detailed indices characterizing each of its subsystems. From a theoretical point of view these methods are generalizations of some classes of iterative and decomposition methods.
MLA
Ryvkin, A. A., et al. “Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems.” Econometrica, vol. 47, .no 4, Econometric Society, 1979, pp. 821-842, https://www.jstor.org/stable/1914133
Chicago
Ryvkin, A. A., I. Y. Vakhutinsky, and L. M. Dudkin. “Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems.” Econometrica, 47, .no 4, (Econometric Society: 1979), 821-842. https://www.jstor.org/stable/1914133
APA
Ryvkin, A. A., Vakhutinsky, I. Y., & Dudkin, L. M. (1979). Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems. Econometrica, 47(4), 821-842. https://www.jstor.org/stable/1914133
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.