Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes
type: Item
instance of: scholarly article
title: Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes
zbMATH Open document ID: 1346.90801
author: F. Dufour
author: Tomás Prieto-Rumeau
published in: Applied Mathematics and Optimization
publication date: 2016-09-23T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 60J05
zbMATH DE Number: 6629424
zbMATH Keywords: Markov decision processes
zbMATH Keywords: linear programming formulation
zbMATH Keywords: constrained problems
MaRDI profile type: Publication
full work available at URL: s00245-015-9307-3
OpenAlex ID: W1200801359
cites work: Q5386174
cites work: Q3066192
cites work: On compactness of the space of policies in stochastic dynamic programming
cites work: Stochastic optimal control. The discrete time case
cites work: Q4547443
cites work: Q4386706
cites work: Approximation of Markov decision processes with general state space
cites work: Splitting randomized stationary policies in total-reward Markov decision processes
cites work: Stochastic finance. An introduction in discrete time
cites work: The economics of risk and time
cites work: Q4255598
cites work: Constrained Markov control processes in Borel spaces: the discounted case
cites work: Q5599448
cites work: Q4323294
cites work: Q3832355
cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
cites work: On dynamic programming: Compactness of the space of policies
cites work: Q5531123
DOI: 10.1007/S00245-015-9307-3
description: scientific article; zbMATH DE number 6629424