No label defined (Q3688091)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3912094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3912094 |
Statements
1985
0 references
decomposition principle
0 references
decentralized planning
0 references
hierarchical firms
0 references
0.8254369497299194
0 references
0.8093626499176025
0 references
0.7966393828392029
0 references
0.7857711911201477
0 references
0.7824146151542664
0 references
[For the entire collection see Zbl 0553.00015.] The aim of this paper is to present a decomposition principle with which decentralized planning is enabled in hierarchical firms. The algorithm is based on the necessary conditions for realizing decentralized planning, i.e. keeping the iteration-steps small; saving autonomy and importance of the several divisions inside the organization. In the first part we induce significant resource allocations, that ensure an efficient information exchange in the several iteration-steps. In the second part a decomposition algorithm is described - characterized by generating supporting hyperplanes in respect of the divisions - which strictly reduces the number of iteration steps. In the third part the advantages and the differences to the existing algorithms are discussed.
0 references