Algorithms to Construct Suboptimal Organization Hierarchies1

摘要

The problem of controlling an organization structure (hierarchy of organization control) was considered as that of discrete optimization, that is, minimization by selecting the permissible hierarchy of total costs of maintaining its managers. For the case of the so-called uniform functions of manager costs, the lower estimate of the costs of the optimal hierarchy was obtained allowing one, besides all other things, to determine approximately the main characteristics of the optimal hierarchy such as the number of managers, their norm of controllability, and so on. Quality of this lower estimate was studied, and effective algorithms to construct suboptimal hierarchies with costs slightly exceeding the optimal ones were proposed for some important cases.