Skip to main content
Log in

The binary search decomposition in a decentralized organization

  • Published:
Theory and Decision Aims and scope Submit manuscript

Abstract

An analytic model of the resource allocation decision process in a decentralized organization is presented. The model follows the philosophy of Kornai and Liptak in its decomposition procedure but employs the binary search technique in its resource allocation process. Briefly, the model provides two important concepts relevant to the decision making process of a decentralized organization: (1) satisficing technique of coordination and (2) simulation of a resource allocation decision process.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arrow, Kenneth J. and Hurwicz, L., ‘Decentralization and Computation in Resource Allocation’, in Pfouts, R. (ed.), Essays in Economics and Econometrics, University of North Carolina Press, Chapel Hill (1960).

    Google Scholar 

  2. Collumb, B. P., ‘Goal Interval Approaches to Intertemporal Analysis and Decentralization in Management’, Ph.D. Dissertation, University of Texas, Austin, 1971.

    Google Scholar 

  3. Dantzig, G. B., Linear Programming and Extensions, Princeton University Press, Princeton, 1963.

    Google Scholar 

  4. Dantzig, G. B. and Wolfe, P., ‘Decomposition Principle for Linear Programs’, Operations Research, Vol. 8, No. 1, February 1960.

  5. Devons, E., Papers on Planning and Economic Management, Manchester University Press, Manchester, 1970.

    Google Scholar 

  6. Freeland, J. R. and Baker, N. R., ‘Goal Partitioning in a Hierarchical Organization’, OMEGA, Vol. 3, No. 6, 1975.

  7. Koopmans, T. C., ‘Analysis of Production as an Efficient Combination of Activities’, T. C. Koopmans (ed.), Activity Analysis of Production and Allocation, John Wiley & Sons, New York, 1951.

    Google Scholar 

  8. Kornai, J., Mathematical Planning of Structural Decisions, North-Holland, Amsterdam, 1969.

    Google Scholar 

  9. Kornai, J. and Liptak, T., ‘Two-Level Planning’, Econometrica 33, No. 1 (January 1965).

  10. Lee, Sang, M., Goal Programming for Decision Analysis, Auerbach Publishers, Inc., Philadelphia, 1972.

    Google Scholar 

  11. Lee, Sang M. and Rho, B. H., ‘The Binary Search Decomposition Method’, A paper presented at the Seventh Annual Meeting of Southeast American Institute for Decision Sciences, Feb. 1977.

  12. Malinvaud, E., ‘Decentralization Procedures for Planning’, in E. Malinvaud and M. O. L. Bacharach, Activity Analysis in the Theory of Growth and Planning, Macmillan (1967).

  13. March, J. and Simon, H., Organizations, John Wiley & Sons, New York, 1958.

    Google Scholar 

  14. Miller, E. C., ‘Objectives and Standards of Performance in Marketing Management’, American Management Association, Research Study, No. 85, 1967.

  15. Rho, B. H., ‘Decomposition Goal Programming: Algorithms, Computations, and Managerial Implications’, Ph.D. Dissertation, Virginia Polytechnic Institute and State University, 1976.

  16. Ruefli, T., ‘A Generalized Goal Decomposition Model’, Management Science, Vol. 17, No. 9, April (1971).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, S.M., Rho, B.H. The binary search decomposition in a decentralized organization. Theor Decis 11, 353–362 (1979). https://doi.org/10.1007/BF00139447

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00139447

Keywords

Navigation