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

On Finding the Maximal Gain for Markov Decision Processes

Author

Listed:
  • Amedeo R. Odoni

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

Abstract

The method of successive approximations for solving problems on single-chain Markovian decision processes has been investigated by White and Schweitzer. This paper shows that White's scheme not only converges, but also can be modified so that monotonic upper and lower bounds on the maximal gain can be obtained.

Suggested Citation

  • Amedeo R. Odoni, 1969. "On Finding the Maximal Gain for Markov Decision Processes," Operations Research, INFORMS, vol. 17(5), pages 857-860, October.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:5:p:857-860
    DOI: 10.1287/opre.17.5.857
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.5.857
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.5.857?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. Dellaert, N. P. & Melo, M. T., 1998. "Make-to-order policies for a stochastic lot-sizing problem using overtime," International Journal of Production Economics, Elsevier, vol. 56(1), pages 79-97, September.
    2. Karel Sladký, 2007. "Stochastic Growth Models With No Discounting [Stochastické růstové modely bez diskontování]," Acta Oeconomica Pragensia, Prague University of Economics and Business, vol. 2007(4), pages 88-98.
    3. Andreatta, G. & Lulli, G., 2008. "A multi-period TSP with stochastic regular and urgent demands," European Journal of Operational Research, Elsevier, vol. 185(1), pages 122-132, February.
    4. Dellaert, N. P. & Melo, M. T., 2003. "Approximate solutions for a stochastic lot-sizing problem with partial customer-order information," European Journal of Operational Research, Elsevier, vol. 150(1), pages 163-180, October.
    5. Dellaert, N. P. & Melo, M. T., 1996. "Production strategies for a stochastic lot-sizing problem with constant capacity," European Journal of Operational Research, Elsevier, vol. 92(2), pages 281-301, July.
    6. Raik Özsen & Ulrich W. Thonemann, 2015. "Determining Optimal Parameters for Expediting Policies," Manufacturing & Service Operations Management, INFORMS, vol. 17(1), pages 120-133, February.
    7. Dijk, N.M. van, 1989. "Truncation of Markov decision problems with a queueing network overflow control application," Serie Research Memoranda 0065, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.

    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:17:y:1969:i:5:p:857-860. 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.