Linear Programming in a Markov Chain

DOI10.1287/opre.10.5.702zbMath0124.36403MaRDI QIDQ5328576

George B. Dantzig, Philip Wolfe

Publication date: 1962

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

Full work available at URL: https://doi.org/10.1287/opre.10.5.702

zbMATH Keywords

operations research

Related Items

Unnamed Item, Unnamed Item, Beiträge zur Dekomposition von linearen Programmen, Primal- und Dual-Algorithmen zur Optimierung von Markov-Prozessen, Mathematical programming and the control of Markov chains†, A methodology for computation reduction for specially structured large scale Markov decision problems, Linear programming solutions of the truncated moment problem, Optimization of file migration policies in distributed computer systems, Markov ratio decision processes, Optimal choice of reward levels in an organization, Numerical comparison of controls and verification of optimality for stochastic control problems, The optimization of K-effect models by linear and dynamic programming, Finite state continuous time Markov decision processes with an infinite planning horizon, Linear programming considerations on Markovian decision processes with no discounting, Extreme points of Leontief substitution systems, Linear programming algorithms for semi-Markovian decision processes, On direct sums of Markovian decision process, A new optimality criterion for discrete dynamic programming, Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations, On a control of a Markov chain under conditions with respect to the absolute stationary probabilities and cost, Optimality in transient markov chains and linear programming, Solving stochastic dynamic programming problems by linear programming — An annotated bibliography