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 In this paper we present an extension of the simplex procedure to deal with separable programming problems where the objective is composed of ...