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

We analyze the problem of finding the first basic solution in the two phases simplex algorithm. Also, a modification and several improvements of the simplex method are introduced. We report ...