Algorithms for finding steady state probabilities for some special classes of finite state Markov chains

DOI10.1016/0167-6377(86)90069-6zbMath0623.90085OpenAlexW1994042593MaRDI QIDQ1091951

U. Narayan Bhat, Ram Lal

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90069-6

zbMATH Keywords

algorithmic methodsGaussian elimination methodirreducible, aperiodic, positive recurrent finite Markov chainssteady state probability vector

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov and semi-Markov decision processes (90C40)

Related Items (1)

Reduced systems in Markov chains and their applications in queueing theory

Cites Work

• An algorithmic approach for a special class of Markov chains
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for finding steady state probabilities for some special classes of finite state Markov chains