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

Steven A. Lippman
Additional contact information
Steven A. Lippman: University of California, Los Angeles, California

Operations Research, 1969, vol. 17, issue 1, 163-174

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.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.1.163 (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:17:y:1969:i:1:p:163-174

Access Statistics for this article

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