
related topics 
{math, number, function} 
{work, book, publish} 
{company, market, business} 
{service, military, aircraft} 
{son, year, death} 
{school, student, university} 
{theory, work, human} 
{system, computer, user} 
{disease, patient, cell} 
{film, series, show} 
{day, year, event} 

U.S. Air Force Office of Statistical Control
RAND Corporation
John von Neumann Theory Prize [1974]
George Bernard Dantzig (November 8, 1914 – May 13, 2005) was an American mathematical scientist who made important contributions to operations research, computer science, economics, and statistics.
Dantzig is known for his development of the simplex algorithm, an algorithm for solving linear programming problems^{[1]}, and his work with linear programming, some years after it was invented by the Soviet mathematician & economist Leonid Kantorovich.^{[2]} In statistics, Dantzig solved two open problems in statistical theory, which he had mistaken for homework after arriving late to a lecture of Jerzy Neyman.
Dantzig was the Professor Emeritus of Transportation Sciences and Professor of Operations Research and of Computer Science at Stanford.
Contents
Biography
Born in Portland, Oregon, George Bernard Dantzig was named after George Bernard Shaw, a British writer.^{[2]} His father, Tobias Dantzig, was a Baltic German mathematician and linguist, and his mother, Anja Dantzig (née Ourisson), was a French linguist . Dantzig's parents met during their study at the Sorbonne University in Paris, where Tobias studied mathematics under Henri Poincaré. The Dantzigs immigrated to the United States, where they settled in Portland, Oregon.
Early in the 1920s the Dantzig family moved from Baltimore to Washington. His mother became a linguist at the Library of Congress, and his father became a math tutor at the University of Maryland, College Park, George 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.^{[1]}
Full article ▸


related documents 
Dewey Decimal Classification 
Benoît Mandelbrot 
William Thurston 
Edsger W. Dijkstra 
Erdős number 
André Weil 
Wacław Sierpiński 
Giuseppe Peano 
Edgar F. Codd 
Jurij Vega 
Louis de Branges de Bourcia 
John Horton Conway 
Spamdexing 
Paul Cohen (mathematician) 
Felix Klein 
Wikipedia:Footnote1 
Tiny BASIC 
Just another Perl hacker 
Norbert Wiener 
Library classification 
Stephen Smale 
Pafnuty Chebyshev 
Web directory 
Canonical LR parser 
Exponential time 
Unification 
Rational root theorem 
EXPTIME 
Most significant bit 
Dirichlet's theorem on arithmetic progressions 
