IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v24y1976i3p477-490.html
   My bibliography  Save this article

Countable-State, Continuous-Time Dynamic Programming with Structure

Author

Listed:
  • Steven A. Lippman

    (University of California, Los Angeles, California)

Abstract

We consider the problem P of maximizing the expected discounted reward earned in a continuous-time Markov decision process with countable state and finite action space. (The reward rate is merely bounded by a polynomial.) By examining a sequence 〈 p N 〉 of approximating problems, each of which is a semi-Markov decision process with exponential transition rate Λ N , Λ N ↗ ∞, we are able to show that P is obtained as the limit of the P N . The value in representing P as the limit of P N is that structural properties present in each P N persist, in both the finite and the infinite horizon problem. Three queuing optimization models illustrating the method are given.

Suggested Citation

  • Steven A. Lippman, 1976. "Countable-State, Continuous-Time Dynamic Programming with Structure," Operations Research, INFORMS, vol. 24(3), pages 477-490, June.
  • Handle: RePEc:inm:oropre:v:24:y:1976:i:3:p:477-490
    DOI: 10.1287/opre.24.3.477
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.24.3.477
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.24.3.477?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chatwin, Richard E., 2000. "Optimal dynamic pricing of perishable products with stochastic demand and a finite set of prices," European Journal of Operational Research, Elsevier, vol. 125(1), pages 149-174, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:24:y:1976:i:3:p:477-490. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.