George Dantzig

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 Jerzy Neyman.

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.

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.

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.

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.

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.

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.

He had prepared one of Dantzig's solutions for publication in a mathematical journal.

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.

From 1941 to 1946, he became the head of the combat analysis branch of the Headquarters Statistical Control for the Army Air Forces.

In 1946, he returned to Berkeley to complete the requirements of his program and received his PhD that year.

Although he had a faculty offer from Berkeley, he returned to the Air Force as mathematical advisor to the comptroller.

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.

He was a member of the National Academy of Sciences, the National Academy of Engineering, and the American Academy of Arts and Sciences.

Dantzig was the recipient of many honors, including the first John von Neumann Theory Prize in 1974, the National Medal of Science in 1975, and an honorary doctorate from the University of Maryland, College Park in 1976.

The Mathematical Programming Society honored Dantzig by creating the George B. Dantzig Prize, bestowed every three years since 1982 on one or two people who have made a significant impact in the field of mathematical programming.

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 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.

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.