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

This is a preview. Log in through your library . Abstract The Linear Programming Problem is by far the most widely used optimization model. Its impact on economic and government modeling is immense.