A note on dynamic programming with unbounded rewards

J.A.E.E. van Nunen, J. Wessels

    Research output: Contribution to journalArticleAcademicpeer-review


    In a recent paper, Lippman presents sufficient conditions for Denardo's N-stage contraction in discounted semi-Markov decision processes with unbounded rewards. In this note it is demonstrated that Lippman's conditions may be replaced by weaker conditions which even imply 1-stage contraction. The verification of the conditions of this note is somewhat easier.
    Original languageEnglish
    Pages (from-to)576-580
    Number of pages6
    JournalManagement Science
    Issue number5
    Publication statusPublished - 1978


    Dive into the research topics of 'A note on dynamic programming with unbounded rewards'. Together they form a unique fingerprint.

    Cite this