Dantzig, George

▪ 2006

      American mathematician (b. Nov. 8, 1914, Portland, Ore.—d. May 13, 2005, Stanford, Calif.), devised the simplex algorithm, a method for solving problems that involve numerous conditions and variables, and in the process founded the field of linear programming. Dantzig earned a bachelor's degree in mathematics and physics from the University of Maryland (1936) and a master's degree in mathematics from the University of Michigan (1937) before joining the U.S. Bureau of Labor Statistics as a statistician. In 1939 he entered the graduate mathematics program at the University of California, Berkeley. From 1941 to 1946 Dantzig was the civilian head of the Combat Analysis Branch, U.S. Air Force Headquarters Statistical Control. In 1946 he returned for one semester to Berkeley to receive his Ph.D. and then went on to Washington to work for the U.S. Department of Defense. While working on allocation of resources (materials and personnel) for various projects and deployments of the U.S. Air Force, Dantzig invented (1947) the simplex algorithm for optimization. At that time such scheduling was called programming, and it soon became apparent that the simplex algorithm was ideal for translating formerly intractable problems involving hundreds, or even thousands, of factors for solution by the recently invented computer. From 1952 to 1960 he was a research mathematician at the RAND Corporation, where he helped develop the field of operations research (essentially, the application of computers to optimization problems). From 1960 to 1966 he served as chairman of the Operations Research Center at Berkeley, and from 1966 until his retirement in 1997, he was a professor of operations research and computer science at Stanford University. Among Dantzig's numerous awards were the Von Neumann Theory Prize in Operations Research (1975), the National Medal of Science (1975), and the National Academy of Sciences Award in Applied Mathematics and Numerical Analysis (1977).

* * *