The mission to improve the widely used simplex-method algorithm showed instead why it works so well.

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