Abstract
Part I of this paper introduces a general framework for the discussion of discrete production sets and the associated programming problems which arise when a particular endowment of factors is specified. In this part of the paper we shall apply these ideas to integer programming problems with two activities and bring to bear some of the basic considerations of the theory of computational complexity. The numbering of sections, figures, and equations will follow those used in Part I.
The research described in this paper and its predecessor was supported by a grant from the National Science Foundation. Some of the material was presented in the Fisher-Schultz lecture delivered at the 1978 European Meeting of the Econometric Society.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
HIRSCHBERG, D. S., AND C. K. WONG: “A Polynomial-Time Algorithm for the Knapsack Problem in Two Variables,” Jour. Ass. Comp. Math., 23 (1976), 147–154.
KANNAN, ROVINDRAN: “A Polynomial Algorithm for the Two Variable Integer Programming Problem,” Technical Report No. 348, School of Operations Research, Cornell University, Ithaca, New York, 1977.
GAREY, MICHAEL R., AND DAVID S. JOHNSON: Computers and Intractability. San Francisco: W. H. Freeman, 1979.
Editor information
Editors and Affiliations
Copyright information
© 2008 Herbert Scarf
About this chapter
Cite this chapter
Scarf, H.E. (2008). Production Sets with Indivisibilities Part II. The Case of Two Activities. In: Yang, Z. (eds) Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research. Palgrave Macmillan, London. https://doi.org/10.1057/9781137024411_3
Download citation
DOI: https://doi.org/10.1057/9781137024411_3
Publisher Name: Palgrave Macmillan, London
Print ISBN: 978-1-137-02440-4
Online ISBN: 978-1-137-02441-1
eBook Packages: Palgrave Economics & Finance CollectionEconomics and Finance (R0)