Skip to main content
Article thumbnail
Location of Repository

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

By Charles H. Kafpauf


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.

DOI identifier: 10.1287/mnsc.21.12.1471
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.