We prove that the classic policy-iteration method [Howard, R. A. 1960. Dynamic Programming and Markov Processes. MIT, Cambridge] and the original simplex method with the most-negative-reduced-cost ...

Provided the constraints are linear, problems of this kind are normally forced into a linear programming mould and solved using the simplex method. This paper takes another look at the associated ...