Abstract. We study the convergence analysis of a Picard-S iterative method for a particular class of weak-contraction mappings and give a data dependence result for fixed points of these mappings.

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