Premium
DECOMPOSITION OF PLANNING SYSTEMS
Author(s) -
KIM CHAIHO
Publication year - 1970
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1970.tb00790.x
Subject(s) - decomposition , computer science , business system planning , order (exchange) , operations research , operation planning , benders' decomposition , mathematical optimization , process management , mathematics , business , ecology , finance , biology
While Dantzig and Wolfe have formulated the decomposition algorithm as a computational device, it was subsequently recognized that the principle underlying the algorithm may also be utilized by a planning system to achieve a centralized planning within the framework of a decentralized organizational structure. This paper illustrates the workings of such a planning system and, at the same time, explores some of the problems connected with its actual implementation. The planning system under the study is called the decomposed planning system in order to distinguish it from either the centralized planning or the decentralized planning.