An observation on the structure of production sets with indivisibilities

Herbert Scarf

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

Abstract: Abstract A subset of the constraints of an integer programming problem is said to be binding if, when the remaining constraints are eliminated, the smaller problem has the same optimal solution as the original problem. It is shown that an integer programming problem with n variables has a set of binding constraints of cardinality less than or equal to 2n−1. The bound is sharp.

Keywords: Programming Problem; Integer Programming; Large Firm; Finite Subset; Integer Programming Problem (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:
Working Paper: An Observation on the Structure of Production Sets with Indivisibilities (1977)
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_1

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

DOI: 10.1057/9781137024411_1

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 ().