Skip to main content
Log in

Markov decision programming with constraints

  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

Some finite horizon MDPs and infinite horizon discounted MDPs with constraints are discussed in this paper. Some available algorithms are given separately for various models discussed in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Frederick, J. Beutler and Keith, W. Ross, Optimal Policies for Controlled Markov Chains with a Constraint,J. Math. Anal. Appl.,112 (1985), 236–252.

    Google Scholar 

  2. Furukawa, N., Characterization of Optimal Policies in Vector-valued Markovian Decision Processes,Math. Oper. Res.,5:2 (1980), 271–279.

    Google Scholar 

  3. Furukawa, N., Vector-valued Markovian Decision Processes with Countable State Space, Recent Developments in Markov Decision Processes, Academic Press, London, New York, Toronto, Sydney, San Francisco, 1980, 205–223.

    Google Scholar 

  4. Derman, C., Finite State Markovian Decision Processes, Academic Press, New York, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This project is supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J., Liu, K. Markov decision programming with constraints. Acta Mathematicae Applicatae Sinica 10, 1–11 (1994). https://doi.org/10.1007/BF02006255

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02006255

Key words

Navigation