We consider discounted Markov decision processes (MDPs) with countably-infinite state spaces, finite action spaces, and unbounded rewards. Typical examples of such MDPs are inventory management and ...

We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a ...

These criteria are useful when you want to divide a time-consuming optimization problem into a series of smaller problems. Since the Nelder-Mead simplex algorithm does not use derivatives, no ...

George B. Dantzig, the mathematician who invented the field of linear programming, which revolutionized the way government and private enterprise planned, scheduled and generally conducted their ...

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

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