Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T05:48:37.107Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  19 October 2009

Extract

Consider the following linear programming problem, which is denoted by (S):The various vectors and matrices have the following dimensions:a = an m-vectorAj = (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, andxj = (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.

Information

Type
Research Article
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.)

Article purchase

Temporarily unavailable