MIT, Cambridge] and the original simplex method with the most-negative-reduced-cost pivoting rule of Dantzig are strongly polynomial-time algorithms for solving the Markov decision problem (MDP) with ...

R. O'Neill, Algorithm AS 47: Function Minimization Using a Simplex Procedure, Journal of the Royal Statistical Society. Series C (Applied Statistics), Vol. 20, No. 3 (1971), pp. 338-345 ...