A polynomial time bound for Howard's policy improvement algorithm
Authors:
- 1 March 1986
- journal article
- research article
- Published by Springer Nature in OR Spectrum
- Vol. 8 (1) , 37-40
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimalProbability Theory and Related Fields, 1975
- Foundations of Non-stationary Dynamic Programming with Discrete Time Parameter1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- Dynamic Programming and Markov ProcessesTechnometrics, 1961
- Linear Programming and Sequential DecisionsManagement Science, 1960