Planning-Horizon Theorems for Knapsack and Renewal Problems with a Denumerable Number of Activities

Abstract

This paper considers a class of knapsack and renewal problems and gives necessary conditions and sufficient conditions under which there is an (easily found) immediate decision that is optimal (with or without discounting) for all sufficiently large horizons.