Linear Programming in a Markov Chain
Notes on Linear Programming and Extensions — Part 59
ResearchPublished 1962
Notes on Linear Programming and Extensions — Part 59
ResearchPublished 1962
A study concerned with an infinite Markov process with a finite number of states in which the transition probabilities for each stage range independently over sets that either are finite or are convex polyhedra. A finite computational procedure is given for choosing those transition probabilities which minimize appropriate functions of the resulting equilibrium probabilities.
This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.