JSTOR Daily

The Simplex Method: Two Basic Variables Replacement

The paper presents a method for solving the linear programming problems, which is itself a step towards the generalization of the classical Simlex Method. It replaces two basic variables by two ...
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 ...
NPR

A Mathematician Who Solved Major Problems

The death of mathematician George Dantzig is a scientific watershed. Dantzig developed "linear programming" and the simplex method, used to solve complex efficiency problems for large organizations.
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: ...
Simon Fraser University

NLPNMS Call

See "Nonlinear Optimization and Related Subroutines" for a listing of all NLP subroutines. See Chapter 11, "Nonlinear Optimization Examples," for a description of the inputs to and outputs of all NLP ...
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 ...