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 ...

Moreover, a new, ratio-test-free pivoting rule is proposed, significantly reducing computational cost at each iteration. Our numerical experiments show that the method is very promising, at least for ...