Test sets for integer programs

Herbert Scarf

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

Abstract: Abstract In this paper I discuss various properties of the simplicial complex of maximal lattice free bodies associated with a matrix A. If the matrix satisfies some mild conditions, and is generic, the edges of the complex form the minimal test set for the family of integer programs obtained by selecting a particular row of A as the objective function, and using the remaining rows to impose constraints on the integer variables. © 1997 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

Keywords: Test sets; Integer programming; Simplicial complexes; Groebner bases (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:
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_9

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

DOI: 10.1057/9781137024411_9

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