Turnpike Theorems for Integer Programming Problems

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.