Updated: 09/15/2017 by Computer Hope
Name: George Bernard Dantzig
Born: November 8, 1914, in Portland, Oregon USA
Death: May 13, 2005 (Age: 91)
- American mathematical scientist. Best known for his work on Linear programming, the Simplex algorithm, the Dantzig-Wolfe decomposition principle, and Generalized linear programming. Also, his work on Generalized upper bounding, Max-flow min-cut theorem of networks, Quadratic programming, Complementary pivot algorithms, and Stochastic programming.
- Notes on linear programming (1953).
- Linear inequalities and related systems (1956).
- Linear programming and extensions (1963).
- On the continuity of the minimum set of a continuous function (1966).
- Mathematics of the decision sciences (1968).
- Lectures in differential equations (1969).
- Natural gas transmission system optimization (1970).
- Compact city; a plan for a liveable urban environment (1973).
- Studies in optimization (1974).
- Mathematical programming : essays in honor of George B. Dantzig (1985).
- Linear programming 1: Introduction (1997).
- Linear programming 2: Theory and Extensions (2003).
- The Basic George B. Dantzig (2003).
Honors and awards
- John von Neumann Theory Prize (1974).
- National Medal of Science (USA) in Mathematical, Statistical, and Computational Sciences (1975]).
- Harvey Prize (1985).