George Dantzig

Uses your system voice; voice and rate in settings.

Snapshot

≈ 7 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

George Bernard Dantzig ( ; November 8, 1914 – May 13, 2005) was an American mathematical scientist who made contributions to industrial engineering, operations research, computer science, economics, and statistics. Dantzig is known for his development of the simplex algorithm, an algorithm for solving linear programming problems, and for his other work with linear programming. In statistics, Dantzig solved two open problems in statistical theory, which he had mistaken for homework after arriving late to a lecture by Polish mathematician-statistician Jerzy Neyman. At his death, Dantzig was professor emeritus of transportation sciences and professor of operations research and of computer science at Stanford University.

George Bernard Dantzig ( ; November 8, 1914 – May 13, 2005) was an American mathematical scientist who made contributions to industrial engineering, operations research, computer science, economics, and statistics. Dantzig is known for his development of the simplex algorithm, an algorithm for solving linear programming problems, and for his other work with linear programming. In statistics, Dantzig solved two open problems in statistical theory, which he had mistaken for homework after arriving late to a lecture by Polish mathematician-statistician Jerzy Neyman. At his death, Dantzig was professor emeritus of transportation sciences and professor of operations research and of computer science at Stanford University.

Early life

Born to Jewish parents in Portland, Oregon, George Bernard Dantzig was named after George Bernard Shaw, the Irish writer. 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. The Dantzigs emigrated to the United States, where they settled in Portland, Oregon. Early in the 1920s the Dantzig family moved from Baltimore to Washington, D.C. His mother became a linguist at the Library of Congress, and his father became a math tutor at the University of Maryland, College Park.

Education

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. 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, he enrolled in the doctoral program in mathematics at the University of California, Berkeley, where he studied statistics under Jerzy Neyman. During his study in 1939, Dantzig solved two unsolved problems in statistics due to a misunderstanding. 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. Six weeks later, an excited Neyman happily told him that the problems he had solved were two of the most famous unsolved problems in statistics. He had prepared one of Dantzig's solutions for publication in a mathematical journal. This story 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 1997 film Good Will Hunting.

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." Years later, another researcher, Abraham Wald, was preparing to publish a paper in which 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.

Linear programming

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 19471. 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. 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, and today industrial linear programs with tens or hundreds of thousands or even more variables are routinely solved.

In 1963, Dantzig's Linear Programming and Extensions was published by Princeton University Press. It quickly became a standard text in linear programming.

Publications

Books by George Dantzig: 1953. Notes on linear programming. RAND Corporation. 1956. Linear inequalities and related systems. With others. Edited by H.W. Kuhn and A.W. Tucker. Princeton University Press. 1963. Linear programming and extensions. Princeton University Press and the RAND Corporation. pdf from RAND 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. Book chapters: . Articles, a selection:

See also

Dantzig–Wolfe decomposition Knapsack problem Maximum flow problem Optimization (mathematics) Travelling salesman problem Shadow price

Notes

Further reading

"Professor George Dantzig: Linear Programming Founder Turns 80" , SIAM News, November 1994

External links

Tributes to George Dantzig and Leonid Khachiyan Obituaries of George Dantzig Interview with George B. Dantzig: The Father of Linear Programming – The College Mathematical Journal, 1986 INFORMS George Dantzig Memorial Website Biography of George Dantzig from the Institute for Operations Research and the Management Sciences (INFORMS) An Interview with Nobel Laureate Harry M. Markowitz

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378114820 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “George Dantzig” revision 1378114820 · retrieved 2026-10-20 publication date (×1) · confidence 0.95 revision URL