The Allocation of Resources in the Presence of Indivisibilities
The pricing tests for optimality in a convex programming problem are not available when the production possibility set displays economies of scale. The paper argues that indivisibilities in production are one of the major causes of such economies. The constrained optimization problems arising in the presence of indivisibilities are integer programs, and it is proposed that the unique, minimal quantity tests for such problems may shed some light on the internal organization of a large firm.
|Date of creation:||Jan 1994|
|Publication status:||Published in Journal of Economic Perspectives (Fall 1994), 8(4): 111-128|
|Contact details of provider:|| Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA|
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Herbert E. Scarf, 1990. "Mathematical Programming and Economic Theory," Operations Research, INFORMS, vol. 38(3), pages 377-385, June.
- László Lovász & Herbert E. Scarf, 1992. "The Generalized Basis Reduction Algorithm," Mathematics of Operations Research, INFORMS, vol. 17(3), pages 751-764, August.
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1068. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Matthew C. Regan)
If references are entirely missing, you can add them using this form.