Turnpike Theorems for Integer Programming Problems

Jeremy F. Shapiro
Additional contact information
Jeremy F. Shapiro: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1970, vol. 18, issue 3, 432-440

Abstract: A certain class of integer programming problems, called asymptotic or steady-state, has been shown by Gomory to be cost equivalent to a group-optimization problem. This paper extends the algebraic characterization by demonstrating that there are cost-equivalent group problems for all integer programming problems. Finally, the result is interpreted from the viewpoint of dynamic programming, and this provides the turnpike theorem.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.3.432 (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:oropre:v:18:y:1970:i:3:p:432-440

Access Statistics for this article

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