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

In this paper, we first propose a perturbation procedure for achieving dual feasibility, which starts with any basis without introducing artificial variables. This procedure and the dual simplex ...