Constrained Markov control processes in Borel spaces: The discounted case

Mathematical Methods of Operations Research

Volumn 52, Issue 2, 2000, Pages 271-285

  Hernández Lerma, Onésimo ^a   González Hernández, Juan ^b  

^a DEPARTAMENTO DE FÍSICA   (Mexico)

^b UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Constrained Markov control processes; Discounted cost criterion; Infinite dimensional linear programming

Indexed keywords

EID: 0000636736     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000071     Document Type: Article

References (27)

1. Altman E (1999) Constrained Markov decision processes. Chapman & Hall/CRC, Boca Raton, FL
2. Anderson EJ, Nash P (1987) Linear programming in infinite-dimensional spaces. Wiley, Chichester, U.K.
3. Billingsley P (1968) Convergence of probability measures. Wiley, New York
4. Borkar VS (1994) Ergodic control of Markov chains with constraints - the general case. SIAM J. Control Optim. 32:176-186
5. Bourbaki N (1969) Integration, Chap. IX. Hermann, Paris
6. Craven BD, Koliha JJ (1977) Generalizations of Parkas' theorem. SIAM J. Math. Anal. Appl. 8:983-997
7. Dynkin EB, Yushkevich AA (1979) Controlled Markov processes. Springer-Verlag, Berlin
8. Feinberg E, Shwartz A (1996) Contrained discounted dynamic programming. Math. Oper. Res. 21:922-945
9. Feinberg E, Shwartz A (1999) Constrained dynamic programming with two discount factors: applications and an algorithm. IEEE Trans. Autom. Control 44:628-631
10. González-Hernández J, Hernández-Lerma O (1999) Envelopes of sets of measures, tightness, and Markov control processes. Appl. Math. Optim. 40:377-392
11. Hernández-Lerma O, González-Hemández J, López-Martínez RR (1999) Constrained average cost Markov control processes in Borel spaces. Reporte Interno #262, Depto. de Malemáticas, CINVESTAV-IPN, México
12. Hernández-Lerma O, Lasserre JB, An extension of the Vitali-Hahn-Saks theorem. Proc. Amer. Math. Soc., 124(1996), pp. 3673-3676; correction, ibid., 126(1998), p. 949.
13. Hernández-Lerma O, Lasserre JB (1996) Discrete-time Markov control processes: basic optimality criteria. Springer-Verlag, New York
14. Hernández-Lerma O, Lasserre JB (1997) Cone-constrained linear equations in Banach spaces. J. Convex Anal. 4:149-164
15. Hernández-Lerma O, Lasserre JB (1998) Approximation schemes for infinite linear programs. SIAM J. Optim. 8:973-988.
16. Hernández-Lerma O, Lasserre JB (1998) Linear programming approximations for Markov control processes in metric spaces. Acta Appl. Math. 51:123-139
17. Hernández-Lerma O, Lasserre JB (1999) Further topics on discrete-time Markov control processes. Springer-Verlag, New York
18. Hinderer K (1970) Foundations of non-stationary dynamic programming with discrete-time parameter. Lecture Notes Oper. Res. Math. Syst. 33, Springer-Verlag, Berlin
19. Hordijk A, Spieksma F (1989) Constrained admission control to a queueing system. Adv. Appl. Prob. 21:409-431
20. Huang Y, Kurano M (1997) The LP approach in average rewards MDPs with multiple cost constraints: The countable state case. J. Inform. Optim. Sci. 18:33-47
21. Kurano M, Nakagami J-I, Huang Y (1999) Constrained Markov decision processes with compact state and action spaces: the average case, preprint, Faculty of Education, Chiba University, Japan
22. Lazar A (1983) Optimal flow control of a class of queueing networks in equilibrium. IEEE Trans. Autom. Control 28:1001-1007
23. López-Martínez RR, Hernández-Lerma O, The Lagrange approach to constrained Markov control processes in Borel spaces. (In preparation.)
24. Piunovsky AB (1997) Optimal control of random sequences in problems with constraints. Kluwer, Boston
25. Sennott LI (1991) Constrained discounted Markov decision chains. Prob. Eng. Inform. Sci. 5:463-475
26. Sennott LI (1993) Constrained average cost Markov decision chains. Prob. Eng. Inform. Sci. 7:69-83
27. Vakil F, Lazar AA (1987) Flow control protocols for integrated networks with partially observed voice traffic. IEEE Trans. Autom. Control 32:2-14