IDEAS home Printed from https://ideas.repec.org/a/spr/anresc/v55y2002i3p461-484.html
   My bibliography  Save this article

Convergence of the optimal values of constrained Markov control processes

Author

Listed:
  • Jorge Alvarez-Mena
  • Onésimo Hernández-Lerma

Abstract

We consider a sequence of discounted cost, constrained Markov control processes (CCPs) with countable state space, metric action set and possibly unbounded cost functions. We give conditions under which the sequence of optimal values of the CCPs converges to the optimal value of a limiting CCP, and, furthermore, the accumulation points of sequences of optimal policies for the CCPs are optimal policies for the limiting CCP. These results are obtained via an approximation theorem for general minimization problems. Copyright Springer-Verlag Berlin Heidelberg 2002

Suggested Citation

  • Jorge Alvarez-Mena & Onésimo Hernández-Lerma, 2002. "Convergence of the optimal values of constrained Markov control processes," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 55(3), pages 461-484, June.
  • Handle: RePEc:spr:anresc:v:55:y:2002:i:3:p:461-484
    DOI: 10.1007/s001860200209
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200209
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s001860200209?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Guo, Xianping & Zhang, Wenzhao, 2014. "Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints," European Journal of Operational Research, Elsevier, vol. 238(2), pages 486-496.
    2. Lanlan Zhang & Xianping Guo, 2008. "Constrained continuous-time Markov decision processes with average criteria," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 323-340, April.
    3. Yonghui Huang & Qingda Wei & Xianping Guo, 2013. "Constrained Markov decision processes with first passage criteria," Annals of Operations Research, Springer, vol. 206(1), pages 197-219, July.
    4. Wenzhao Zhang, 2019. "Discrete-Time Constrained Average Stochastic Games with Independent State Processes," Mathematics, MDPI, vol. 7(11), pages 1-18, November.

    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:spr:anresc:v:55:y:2002:i:3:p:461-484. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.