JSTOR Daily

The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

This is a preview. Log in through your library . Abstract We prove that the classic policy-iteration method [Howard, R. A. 1960. Dynamic Programming and Markov Processes. MIT, Cambridge] and the ...
JSTOR Daily

Integral Simplex Using Decomposition for the Set Partitioning Problem

Since the 1970s, several authors have studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm that find an optimal solution via a sequence of basic ...
Harvard Business School

Exploiting Degeneracy in the Simplex Method

Perold, André. "Exploiting Degeneracy in the Simplex Method." In Large Scale Linear Programming, edited by G. B. Dantzig, M. A. H. Dempster, and Markku Kallio ...
Harvard Business School

A Degeneracy Exploiting LU Factorization for the Simplex Method

Perold, André. "A Degeneracy Exploiting LU Factorization for the Simplex Method." In Large Scale Linear Programming, edited by G. B. Dantzig, M. A. H. Dempster, and Markku Kallio. Laxenburg, Austria: ...
MIT Technology Review

The Simplex Solution

While sitting in a courtroom, waiting to find out if he would be chosen for jury duty, Daniel Spielman had a revelation-all the work he and colleague Shanghua Teng had built up over the past three ...