Production Sets with Indivisibilities Part II. The Case of Two Activities

Herbert Scarf

Chapter 3 in Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, 2008, pp 39-67 from Palgrave Macmillan

Abstract: 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.

Keywords: Lattice Point; Integer Program; Large Firm; Sign Pattern; Polynomial Algorithm (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: Production Sets with Indivisibilities-Part II: The Case of Two Activities (1981)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-1-137-02441-1_3

Ordering information: This item can be ordered from
http://www.palgrave.com/9781137024411

DOI: 10.1057/9781137024411_3

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().