LINEAR PROGRAMMING IN A MARKOV CHAIN
RAND CORP SANTA MONICA CA
Pagination or Media Count:
An infinite Markov process with a finite number of states is studied in which the transition probabilities for each state range independently over sets which are either 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.
- Operations Research