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 ...
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 ...
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 ...
Simon Fraser University

New Features: PROC NETFLOW

PROC NETFLOW solves network problems that can have side constraints. Certain algebraic features of networks are exploited by a specialized version of the Simplex method so that solution times are ...
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: ...