Communicating MDPs: Equivalence and LP properties
type: Item
instance of: scholarly article
title: Communicating MDPs: Equivalence and LP properties
zbMATH Open document ID: 0659.90095
DOI: 10.1016/0167-6377(88)90062-4
author: Jerzy Filar
author: Todd A. Schultz
published in: Operations Research Letters
publication date: 1988-01-01T00:00:00Z
review text: The communicating property of Markov decision processes (MDP) is equivalent to the satisfaction of sets of linear equations. A mapping between ``multichain'' and ``unchain'' linear programs for undiscounted MDPs developed by using this equivalence is used to show that the simplex linear program solves communicating MDPs.
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 4079195
zbMATH Keywords: irreducible Markov chain
reviewed by: Howard J. Weiner
MaRDI profile type: Publication
full work available at URL: 0167-6377(88)90062-4
OpenAlex ID: W2070266110
cites work: Optimal decision procedures for finite Markov chains. Part II: Communicating systems
cites work: Discrete Dynamic Programming
cites work: On Linear Programming in a Markov Decision Problem
cites work: Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem
cites work: Multichain Markov Renewal Programs
cites work: Finite state Markovian decision processes
cites work: Linear Programming and Markov Decision Chains
cites work: Q4739658
cites work: Linear programming and sequential decisions
description: scientific article; zbMATH DE number 4079195