Dantzig, George B. (1914–2005)
George Dantzig is known as ‘father of linear programming’ and ‘inventor of the simplex method’. This biographical sketch traces the high points of George Dantzig’s professional life and scholarly achievements. The discussion covers his graduate student years, his wartime service at the US Air Force’s Statistical Control Division, his post-war creativity while serving as a mathematical advisor at the US Air Force Comptroller’s Office and as a research mathematician at the RAND Corporation, his distinguished career in academia – at UC Berkeley and later at Stanford University – and finally as an emeritus professor of operations research.
KeywordsComplementarity Computational complexity Convex programming Convexity Dantzig, G. B Decomposition principle Degeneracy Distributed computation Hurwicz, L Integer programming Interior point methods Kantorovich, L.V Koopmans, T.C Lagrangian function Leontief, W. W Linear programming Logarithmic barrier method Mathematical programming Neyman, J Nonlinear programming Operations research Simplex method for solving linear programs Stochastic programming with recourse von Neumann, J Wood, M.K
Acknowledgments The authors are grateful to David Dantzig, Jessica Dantzig Klass, and many of Dantzig’s friends and colleagues who have contributed to this bio- graphical article. These include A.J. Hoffman, G. Infanger, E. Klotz, J.C. Stone, M.J. Todd, J.A. Tomlin and M.H. Wright. This article has also benefited from other writings on G.B. Dantzig’s life, namely: Albers and Reid (1986), Albers, Alexanderson and Reid (1990), Cottle (2003, 2005, 2006), Cottle and Wright (2006), Dantzig (1982, 1991), Dorfman (1984), Gill et al. (2007), Kersey (1989), Lustig (2001), Gass (1989, 2002, 2005).
- Albers, D.J., G.L. Alexanderson, and C. Reid. 1990. More mathematical people. New York: Harcourt Brace Jovanovich.Google Scholar
- Arrow, K.J., L. Hurwicz, and H. Uzawa. 1958. Studies in linear and non-linear programming. Stanford: Stanford University Press.Google Scholar
- Cottle, R.W. 1964. Nonlinear programs with positively bounded Jacobians. Ph.D. thesis. Department of Mathematics. University of California at Berkeley.Google Scholar
- Cottle, R.W. 2003. The basic George B. Dantzig. Stanford: Stanford University Press.Google Scholar
- Cottle, R.W., and M.H. Wright. 2006. Remembering George Dantzig. SIAM News 39(3): 2–3.Google Scholar
- Dantzig, T. 1930. Number, The language of science. New York: Macmillan. 4th edition, ed. J. Mazur, republished New York: Pi Press, 2005.Google Scholar
- de la Vallée Poussin, M.C.J. 1911. Sur la méthode de l’approximation minimum. Annales de la Société Scientifique de Bruxelles 35: 1–16.Google Scholar
- Dorfman, R., P.A. Samuelson, and R.M. Solow. 1958. Linear programming and economic analysis. New York: McGraw-Hill.Google Scholar
- Fiacco, A.V., and G.P. McCormick. 1968. Nonlinear programming: Sequential unconstrained minimization techniques. New York: Wiley.Google Scholar
- Ford Jr., L.R., and D.R. Fulkerson. 1962. Flows in networks. Princeton: Princeton University Press.Google Scholar
- Fourier, J.B.J. 1826. Solution d’une question particulière du calcul des inégalités. Nouveau Bulletin des Sciences par la Société Philomatique de Paris, 99–100. Reprinted in Oeuvres de Fourier, Tome II, ed. G. Darboux. Paris: Gauthier, 1890.Google Scholar
- Frisch, R.A.K. 1955. The logarithmic potential method of convex programs. Oslo: University Institute of Economics.Google Scholar
- Gale, D., H.W. Kuhn, and A.W. Tucker. 1951. Linear programming and the theory of games. In Activity analysis of production and allocation, ed. T.C. Koopmans. New York: Wiley.Google Scholar
- Gass, S.I. 1989. Comments on the history of linear programming. IEEE Annals of the History of Computing 11(2): 147–151.Google Scholar
- Gass, S.I. 2005. In Memoriam, George B. Dantzig. 2005. Online. Available at http://www.lionhrtpub.com/orms/orms-8-05/dantzig.html. Accessed 12 Jan 2007.
- Gill, P.E., Murray, W., Saunders, M.A., Tomlin, J.A. and Wright, M.H. 2007. George B. Dantzig and systems optimization. Online. Available at http://www.stanford.edu/group/SOL/GBDandSOL.pdf. Accessed 2 Feb 2007.
- Hoffman, A. 1953. Cycling in the Simplex Algorithm. Report No. 2974. Washington, DC: National Bureau of Standards.Google Scholar
- Hopp, W.J., ed. 2004. Ten most influential papers of Management Science’s first fifty years. Management Science 50(12 Supplement), 1764–1769.Google Scholar
- Infanger, G. 1991. Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Ann. Oper. Res. 39: 41–67.Google Scholar
- John, F. 1948. Extremum problems with inequalities as side conditions. In Studies and essays, Courant anniversary volume, ed. K.O. Friedrichs, O.E. Neugebauer, and J.J. Stoker. New York: Wiley-Interscience.Google Scholar
- Kantorovich, L.V. 1942. Translocation of masses. Doklady Akademii Nauk SSSR 37: 199–201. Reprinted in Management Science 5 (1958–59), 1–4.Google Scholar
- Kantorovich, L.V. and Gavurin, M.K. 1949. The application of mathematical methods to freight flow analysis. Problems of Raising the Efficiency of Transport Performance. Akademiia Nauk, USSR. (Kantorovich confirmed the paper was completed and submitted in 1940, but publication delayed by the Second World War.)Google Scholar
- Karush, W. 1939. Minima of functions of several variables with inequalities as side constraints. MSc dissertation, Department of Mathematics, University of Chicago.Google Scholar
- Kersey, C. 1989. Unstoppable. Naperville: Sourcebooks, Inc.Google Scholar
- Khachiyan, L.G. 1979. A polynomial algorithm in linear programming in Russian. Doklady Akademii Nauk SSSR 244, 1093–6. English translation: Soviet Mathematics Doklady 20 (1979), 191–4.Google Scholar
- Klee, V., and G.J. Minty. 1972. How good is the simplex algorithm? In Inequalities III, ed. O. Shisha. New York: Academic.Google Scholar
- Koopmans, T.C. 1947. Optimum utilization of the transportation system. Proceedings of the International Statistical Conferences, 1947, vol. 5. Washington D.C. Also in Econometrica 16 (1948), 66–8.Google Scholar
- Koopmans, T.C. (ed.). 1951. Activity analysis of production and allocation. New York: Wiley.Google Scholar
- Kuhn, H.W., and A.W. Tucker. 1951. Nonlinear Programming. In Proceedings of the second Berkeley symposium on mathematical statistics and probability, ed. J. Neyman. Berkeley: University of California Press.Google Scholar
- Lustig, I. 2001. e-optimization.com. Interview with G.B. Dantzig. Online. Available at http://e-optimization.com/directory/trailblazers/dantzig. Accessed 29 Dec 2006.
- Orchard-Hays, W. 1954. A composite simplex algorithm-II, RAND Research Memorandum RM-1275. Santa Monica: RAND Corporation.Google Scholar
- Scarf, H. 1973. The computation of economic equilibria. New Haven: Yale University Press.Google Scholar
- Schrijver, A. 1986. Theory of linear and integer programming. Chichester: Wiley.Google Scholar
- Smale, S. 1983. The problem of the average speed of the simplex method. In Mathematical programming: The state of the art, ed. A. Bachem, M. Grötschel, and B. Korte. Berlin: Springer.Google Scholar
- Todd, M.J. 1996. Potential-reduction methods in mathematical programming. Mathematical Programming 76: 3–45.Google Scholar
- von Neumann, J. 1947. Discussion of a maximum problem. Unpublished working paper dated 15–16 November. In John von Neumann: Collected works, vol. 6, ed. A.H. Taub. Oxford: Pergamon Press, 1963.Google Scholar
- von Neumann, J., and O. Morgenstern. 1944. Theory of games and economic behavior. Princeton: Princeton University Press.Google Scholar