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

Moreover, a new, ratio-test-free pivoting rule is proposed, significantly reducing computational cost at each iteration. Our numerical experiments show that the method is very promising, at least for ...

About the same time, he invented the “simplex method,” an algorithm for solving linear programming problems.