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

The approximated problem is solved by an extension of the Simplex method. The solution method is tested on real-world data and compared with alternative solution methods. Management Science is a cross ...