Communicating MDPs: Equivalence and LP properties

Jerzy A. Filar, Todd A. Schultz

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


It is shown that the communicating property of Markov Decision Processes (MDPs) is equivalent to satisfaction of sets of linear equations. A mapping between the 'multichain' and 'unichain' linear programs for undiscounted MDPs is developed by applying this equivalence. The mapping is used to prove that the simpler linear program solves communicating MDPs.

Original languageEnglish (US)
Pages (from-to)303-307
Number of pages5
JournalOperations Research Letters
Issue number6
StatePublished - Dec 1988


  • irreducible Markov chains
  • linear programming

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'Communicating MDPs: Equivalence and LP properties'. Together they form a unique fingerprint.

Cite this