A Note on "The Equivalence of Integer Programs to Constrained Recursive Systems"

Charles H. Kafpauf
Additional contact information
Charles H. Kafpauf: Northwestern University

Management Science, 1975, vol. 21, issue 12, 1471-1476

Abstract: Nanda proposes (Management Science, March, 1973) an algorithm for transforming a general integer programming problem with elements 0, +1, or -1 in the constraint matrix into an equivalent one in which the primary constraints are supposed to form an integral, recursive substitution system. Unfortunately, the algorithm does not always guarantee this. This note explains why and gives the addition which must be made to the algorithm to yield the results desired by Nanda.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.12.1471 (application/pdf)

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:inm:ormnsc:v:21:y:1975:i:12:p:1471-1476

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().