Hostname: page-component-5c6d5d7d68-pkt8n Total loading time: 0 Render date: 2024-08-20T17:40:09.705Z Has data issue: false hasContentIssue false
  • English
  • Français

Decentralization on the Basis of Price Schedules in Linear Decomposable Resource-Allocation Problems

Published online by Cambridge University Press:  19 October 2009

Peter Jennergren
Get access Rights & Permissions [Opens in a new window]

Extract

Consider the following linear programming problem, which is denoted by (S): The various vectors and matrices have the following dimensions: a = an m-vector Aj = (j = 1 … n), an m by njmatrix, bj = (j = 1 … n), an mj-vector, Bj = (j = 1 … n), an mj by nj matrix, Cj = (j = 1 … n), an nj-vector, and xj = (j = 1 … n), a variable nj-vector.

Problems with this decomposable structure have been extensively studied in economics and management science literature, because they arise in several economic contexts and situations. Therefore, (S) lends itself to more than one economic interpretation, but the following one is hereby adopted for the purposes of this paper: (S) models a two-level manufacturing organization, consisting of headquarters and n producing divisions. Let this organization be called simply “the company”. The company can produce and sell a number of different products, thereby obtaining fixed unit contributions. These contributions are given by the vectors c1, c2, … cn. The products are produced by the different divisions. The variable vector xj (j = 1 … n) gives the production program for the jth division.

Type
Research Article
Information
Journal of Financial and Quantitative Analysis , Volume 7 , Issue 1 , January 1972 , pp. 1407 - 1417
Copyright
Copyright © School of Business Administration, University of Washington 1972

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Arrow, K. J., and Hurwicz, L.. “Decentralization and Computation in Resource Allocation.” In Pfouts, R., ed., Essays in Economics and Econometrics. Chapel Hill, N.C., 1960.Google Scholar
[2]Baumol, W. J.Economic Theory and Operations Analysis, second edition. Englewood Cliffs, N.J., 1965.Google Scholar
[3]Baumol, W. J., and Fabian, T.. “Decomposition, Pricing for Decentralization and External Economies.” Management Science, Vol. II, No. 1, September 1964.Google Scholar
[4]Charnes, A.; Klower, R. W.; and Kortanek, K. O.. “Effective Control through Coherent Decentralization with Preemptive Goals.” Econometrica, Vol. 35, No. 2, April 1967.Google Scholar
[5]Dantzig, G. B.Linear Programming and Extensions. Princeton, 1963.Google Scholar
[6]Dantzig, G. B., and Wolfe, P.. “The Decomposition Algorithm for Linear Programs.” Econometrica, Vol. 29, No. 4, October 1961.Google Scholar
[7]Dorfman, R.; Samuelson, P. A.; and Solow, R. M.. Linear Programming and Economic Analysis. New York, 1958.Google Scholar
[8]Gale, D.The Theory of Linear Economic Models. New York, 1960.Google Scholar
[9]Kornai, J., and Liptak, T.. “Two-Level Planning.” Econometrica, Vol. 33, No. 1, January 1965.Google Scholar
[10]Samuelson, P. A. “Market Mechanisms and Maximization.” In Stiglitz, J., ed., The Collected Scientific Papers of Paul Samuelson, Vol. I. MIT Press, 1966.Google Scholar
[11]Weingartner, H. M.Mathematical Programming and the Analysis of Capital Budgeting Problems. Englewood Cliffs, N.J., 1963.Google Scholar
[12]Whinston, A. “Price Guides in Decentralized Organizations.” In Cooper, W. W., Leavitt, H., and Shelly, M. W., eds., New Perspectives in Organization Research. New York, 1964.Google Scholar
[13]Zschau, E. V. W. “A Primal Decomposition Algorithm for Linear Programming.” Working Paper No. 91, Graduate School of Business, Stanford University, 1967.Google Scholar