Image by mirekmurmir on Pixabay · Pixabay License
George Bernard Dantzig
Sign in to saveAlso known as George B. Dantzig, George Dantzig
American mathematician (1914-2005)
Person · Open Library
- Born
- 1914
- Works
- 17
Top works
- Mathematical programming essays in honor of George B. Dantzig
- The simplex method
- A decomposition principle for linear programs
- Stanford Pilot energy/economic model
- Large-scale linear programming
via Open Library + Wikidata
Music · MusicBrainz
- Type
- Person
- Gender
- Male
- Origin
- United States
- Active from
- 1911-06-29
- Active to
- 1975-12-24
Discography
- On a Note of Triumph1945
- Symphony no. 5 in E “Lenore”1970
- The Planets1970
- The Impressionists1971
- The Fantasy Film World of Bernard Herrmann1974
- The Film Music Of Bernard Herrmann: "The Twisted Nerve", "The Bride Wore Black", "Hangover Square"1974
- Piano Concerto No.11975
- Violin Concerto In A Major (In The Popular Style) / Song Sonata For Violin And Piano / Hexapoda (Five Studies In Jitteroptera)1976
- Torn Curtain1977
- The Magnificent Ambersons: Music From the 1942 Motion Picture Score1990
via MusicBrainz · CC0
Recent publications · Crossref
5 total works indexed
- A short history of<i>SHELX</i>
· 2007 · cited 79,963x
- Bias in meta-analysis detected by a simple, graphical test
· 1997 · cited 48,666x
- Crystal structure refinement with<i>SHELXL</i>
· 2015 · cited 40,959x
- <i>SHELXT</i>– Integrated space-group and crystal-structure determination
· 2015 · cited 27,711x
- The Third International Consensus Definitions for Sepsis and Septic Shock (Sepsis-3)
· 2016 · cited 23,660x
via Crossref · CC0
Key facts
- Born
- George Bernard Dantzig , ( 1914-11-08 ) November 8, 1914, Portland, Oregon , US
- Died
- May 13, 2005 (2005-05-13) (aged 90), Stanford, California , US
- Alma mater
- University of Maryland ( BS ), University of Michigan ( MS ), University of California, Berkeley ( PhD )
- Known for
- Linear programming , Quadratic programming , Stochastic programming , Linear complementarity problem , Max-flow min-cut theorem of networks , Pseudoforest , Vehicle routing problem , Dantzig's simplex algorithm , Dantzig–Wolfe decomposition
- Awards
- John von Neumann Theory Prize (1975) National Medal of Science (1975) , Harvey Prize (1985) , Harold Pender Award (1995)
- Fields
- Mathematics , Operations research , Industrial engineering , Computer science , Economics , Statistics
- Institutions
- U.S. Air Force Office of Statistical Control, RAND Corporation , University of California, Berkeley , Stanford University
- Doctoral advisor
- Jerzy Spława-Neyman
- Doctoral students
- Ilan Adler , Robert Fourer , Alfredo Noel Iusem , Ellis L. Johnson , Thomas Magnanti , Roger J-B Wets , Yinyu Ye
via Wikipedia infobox
~14 min read
Encyclopedic overview
George Bernard Dantzig (/ˈdæntsɪɡ/; 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 Spława-Neyman.
Excerpted from Wikipedia’s “George Bernard Dantzig” article, available under the CC BY-SA 4.0 licence.