At his death, Dantzig was the Professor Emeritus of Transportation Sciences and Professor of Operations Research and of Computer Science at Stanford University.
Born in Portland, Oregon, George Bernard Dantzig was named after George Bernard Shaw, the Irish writer.[3][4] He was born to Jewish parents; his father, Tobias Dantzig, was a mathematician and linguist, and his mother, Anja Dantzig (née Ourisson), was a Russian-born linguist of French-Lithuanian origin. Dantzig's parents met during their study at the University of Paris, where Tobias studied mathematics under Henri Poincaré, after whom Dantzig's brother was named.[4] The Dantzigs emigrated to the United States, where they settled in Portland, Oregon.
Dantzig attended Powell Junior High School and Central High School. By the time he reached high school, he was already fascinated by geometry, and this interest was further nurtured by his father, challenging him with complicated problems, particularly in projective geometry.[2][4]
George Dantzig received his B.S. from University of Maryland in 1936 in mathematics and physics. He earned his master's degree in mathematics from the University of Michigan in 1937. After working as a junior statistician at the Bureau of Labor Statistics from 1937 to 1939,[5] he enrolled in the doctoral program in mathematics at the University of California, Berkeley, where he studied statistics under Jerzy Neyman.
In 1939, a misunderstanding brought about surprising results. Near the beginning of a class, Professor Neyman wrote two problems on the blackboard. Dantzig arrived late and assumed that they were a homework assignment. According to Dantzig, they "seemed to be a little harder than usual", but a few days later he handed in completed solutions for both problems, still believing that they were an assignment that was overdue.[4][6] Six weeks later, an excited Neyman eagerly told him that the "homework" problems he had solved were two of the most famous unsolved problems in statistics.[2][4] He had prepared one of Dantzig's solutions for publication in a mathematical journal.[7] This story began to spread and was used as a motivational lesson demonstrating the power of positive thinking. Over time, some facts were altered, but the basic story persisted in the form of an urban legend and as an introductory scene in the movie Good Will Hunting.[6]
Dantzig recalled in a 1986 interview in the College Mathematics Journal, "A year later, when I began to worry about a thesis topic, Neyman just shrugged and told me to wrap the two problems in a binder and he would accept them as my thesis."[8]
Years later, another researcher, Abraham Wald, was preparing to publish a paper where he had arrived at a conclusion for the second problem when he learned of Dantzig's earlier solution. When Dantzig suggested publishing jointly, Wald simply added Dantzig's name as co-author.[4][8][9]
With the outbreak of World War II, Dantzig took a leave of absence from the doctoral program at Berkeley to work as a civilian for the United States Army Air Forces. From 1941 to 1946, he became the head of the combat analysis branch of the Headquarters Statistical Control for the Army Air Forces.[2] In 1946, he returned to Berkeley to complete the requirements of his program and received his PhD that year.[3] Although he had a faculty offer from Berkeley, he returned to the Air Force as mathematical advisor to the comptroller.[4]
In 1952, Dantzig joined the mathematics division of the RAND Corporation. By 1960, he became a professor in the Department of Industrial Engineering at UC Berkeley, where he founded and directed the Operations Research Center. In 1966, he joined the Stanford faculty as Professor of Operations Research and of Computer Science. A year later, the Program in Operations Research became a full-fledged department. In 1973, he founded the Systems Optimization Laboratory (SOL) there. On a sabbatical leave that year, he managed the Methodology Group at the International Institute for Applied Systems Analysis (IIASA) in Laxenburg, Austria. Later, he became the C. A. Criley Professor of Transportation Sciences at Stanford University.[3]
Freund wrote further that "through his research in mathematical theory, computation, economic analysis, and applications to industrial problems, Dantzig contributed more than any other researcher to the remarkable development of linear programming".[12]
Dantzig's work allows the airline industry, for example, to schedule crews and make fleet assignments. Based on his work, tools are developed "that shipping companies use to determine how many planes they need and where their delivery trucks should be deployed. The oil industry long has used linear programming in refinery planning, as it determines how much of its raw product should become different grades of gasoline and how much should be used for petroleum-based byproducts. It is used in manufacturing, revenue management, telecommunications, advertising, architecture, circuit design and countless other areas".[2]
Linear programming is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships. Linear programming arose as a mathematical model developed during World War II to plan expenditures and returns in order to reduce costs to the army and increase losses to the enemy. It was kept secret until 1947. Postwar, many industries found its use in their daily planning.
The founders of this subject are Leonid Kantorovich, a Russian mathematician who developed linear programming problems in 1939, Dantzig, who published the simplex method in 1947, and John von Neumann, who developed the theory of the duality in the same year.
Dantzig was asked to work out a method the Air Force could use to improve their planning process.[13] This led to his original example of finding the best assignment of 70 people to 70 jobs, showing the usefulness of linear programming. The computing power required to test all the permutations to select the best assignment is vast; the number of possible configurations exceeds the number of particles in the universe. However, it takes only a moment to find the optimum solution by posing the problem as a linear program and applying the Simplex algorithm. The theory behind linear programming drastically reduces the number of possible optimal solutions that must be checked.
In 1963, Dantzig's Linear Programming and Extensions was published by Princeton University Press. The book quickly became a standard text in linear programming.
On October 18, 1976 President Gerald Ford presented Dantzig with the President's National Medal of Science. The award was given "For inventing linear programming and discovering methods that led to wide-scale scientific and technical applications to important problems in logistics, scheduling, and network optimization, and to the use of computers in making efficient use of the mathematical theory."[16]
1966. On the continuity of the minimum set of a continuous function. With Jon H. Folkman and Norman Shapiro.
1968. Mathematics of the decision sciences. With Arthur F. Veinott, Jr. Summer Seminar on Applied Mathematics 5th : 1967 : Stanford University. American Mathematical Society.
1969. Lectures in differential equations. A. K. Aziz, general editor. Contributors: George B. Dantzig and others.
1970. Natural gas transmission system optimization. With others.
1973. Compact city; a plan for a liveable urban environment. With Thomas L. Saaty.
1974. Studies in optimization. Edited with B.C. Eaves. Mathematical Association of America.
1985. Mathematical programming : essays in honor of George B. Dantzig. Edited by R.W. Cottle. Mathematical Programming Society.
1997. Linear programming 1: Introduction. G.B.D. and Mukund N. Thapa. Springer-Verlag.
2003. Linear programming 2: Theory and Extensions. G.B.D. and Mukund N. Thapa. Springer-Verlag.
2003. The Basic George B. Dantzig. Edited by Richard W. Cottle. Stanford Business Books, Stanford University Press, Stanford, California.[17]
Book chapters:
Dantzig, George B. (1960), "General convex objective forms", in Arrow, Kenneth J.; Karlin, Samuel; Suppes, Patrick (eds.), Mathematical models in the social sciences, 1959: Proceedings of the first Stanford symposium, Stanford mathematical studies in the social sciences, IV, Stanford, California: Stanford University Press, pp. 151–158, ISBN9780804700214.
Wood, Marshall K.; Dantzig, George B. (1949). "Programming of Interdependent Activities: I General Discussion". Econometrica. 17 (3/4): 193–9. doi:10.2307/1905522. JSTOR1905522.
Dantzig, George B. (1949). "Programming of Interdependent Activities: II Mathematical Model". Econometrica. 17 (3): 200–211. doi:10.2307/1905523. JSTOR1905523.
Dantzig, George B. (1955). "Optimal Solution of a Dynamic Leontief Model with Substitution". Econometrica. 23 (3): 295–302. doi:10.2307/1910385. JSTOR1910385.
^Gass, Saul I. (2011). "George B. Dantzig". Profiles in Operations Research. International Series in Operations Research & Management Science. Vol. 147. pp. 217–240. doi:10.1007/978-1-4419-6281-2_13. ISBN978-1-4419-6280-5.
Cottle, Richard; Johnson, Ellis; Wets, Roger (March 2007). "George B. Dantzig (1914–2005)"(PDF). Notices of the American Mathematical Society. 54 (3): 344–62.
