Journal
OPTIMIZATION
Volume -, Issue -, Pages -Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2022.2130699
Keywords
Markov decision processes; random non-constant discount factor; constrained control problems; convex programming; Pareto optimality
Funding
- Consejo Nacional de Ciencia y Tecnologia (CONACYT)-Mexico [Ciencia Frontera 2019-87787, PRODEP-2021, CA-38]
Ask authors/readers for more resources
This paper addresses a class of discrete-time Markov decision processes with cost constraints, and proves the existence of optimal control policies and characterizes them based on certain optimality criteria by solving a new problem on a space of occupation measures and a convex program.
This paper addresses a class of discrete-time Markov decision processes in Borel spaces with a finite number of cost constraints. The constrained control model considers costs of discounted type with state-dependent discount factors which are subject to external disturbances. Our objective is to prove the existence of optimal control policies and characterize them according to certain optimality criteria. Specifically, by rewriting appropriately our original constrained problem as a new one on a space of occupation measures, we apply the direct method to show solvability. Next, the problem is defined as a convex program, and we prove that the existence of a saddle point of the associated Lagrangian operator is equivalent to the existence of an optimal control policy for the constrained problem. Finally, we turn our attention to multi-objective optimization problems, where the existence of Pareto optimal policies can be obtained from the existence of saddle-points of the aforementioned Lagrangian or equivalently from the existence of optimal control policies of constrained problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available