- Home
- Best Scientists - Mathematics
- George B. Dantzig

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Engineering and Technology
D-index
42
Citations
22,668
94
World Ranking
2253
National Ranking
902

Mathematics
D-index
54
Citations
36,706
158
World Ranking
594
National Ranking
309

2002 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

1975 - US President's National Medal of Science "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.", Presented by President Ford at a White House Ceremony on October 18, 1976.

1975 - INFORMS John von Neumann Theory Prize

1971 - Member of the National Academy of Sciences

1962 - Fellow of the American Association for the Advancement of Science (AAAS)

- Mathematical optimization
- Programming language
- Algebra

George B. Dantzig mainly investigates Linear programming, Mathematical optimization, Simplex algorithm, Linear-fractional programming and Linear inequality. His work on Criss-cross algorithm as part of general Linear programming study is frequently linked to Second-order cone programming, therefore connecting diverse disciplines of science. His study in the fields of Scheduling and Dynamic programming under the domain of Mathematical optimization overlaps with other disciplines such as Schedule and Discrete variable.

His Simplex algorithm study which covers Dantzig–Wolfe decomposition that intersects with Column generation and Duality. His work carried out in the field of Linear-fractional programming brings together such families of science as Cutting stock problem, Partition problem, Computer programming, Type and Calculus. As a part of the same scientific family, he mostly works in the field of Linear inequality, focusing on Mathematical economics and, on occasion, Big M method.

- Linear Programming and Extensions (5383 citations)
- The Truck Dispatching Problem (2732 citations)
- Decomposition Principle for Linear Programs (1811 citations)

George B. Dantzig focuses on Linear programming, Mathematical optimization, Simplex algorithm, Discrete mathematics and Linear-fractional programming. His Linear programming research includes elements of Linear inequality, Applied mathematics, Combinatorics and Algebra. His Applied mathematics study combines topics in areas such as Energy, Computer programming, Chemical equilibrium and System of linear equations.

His work in Mathematical optimization tackles topics such as Stochastic process which are related to areas like Monte Carlo method. His Simplex algorithm study incorporates themes from Mathematical economics and Product. George B. Dantzig works in the field of Linear-fractional programming, focusing on Criss-cross algorithm in particular.

- Linear programming (46.29%)
- Mathematical optimization (40.00%)
- Simplex algorithm (19.43%)

- Linear programming (46.29%)
- Mathematical optimization (40.00%)
- Stochastic process (5.71%)

His primary areas of investigation include Linear programming, Mathematical optimization, Stochastic process, Simplex algorithm and Importance sampling. His study in Linear programming is interdisciplinary in nature, drawing from both Software, Calculus and Operations research. His Calculus research incorporates elements of Revised simplex method and Path.

In the field of Mathematical optimization, his study on Stochastic programming and Linear-fractional programming overlaps with subjects such as Scale and Order. His work on Criss-cross algorithm as part of general Linear-fractional programming research is frequently linked to Ellipsoid method and Linear complementarity problem, bridging the gap between disciplines. His studies in Simplex algorithm integrate themes in fields like Applied mathematics, Nonlinear programming, Combinatorics and Artificial intelligence.

- Linear Programming under Uncertainty (1211 citations)
- Decision Making and Problem Solving (452 citations)
- Linear Programming 1: Introduction (328 citations)

- Programming language
- Algebra
- Statistics

Linear programming, Mathematical optimization, Importance sampling, Simplex algorithm and Calculus are his primary areas of study. George B. Dantzig carries out multidisciplinary research, doing studies in Linear programming and Vertex. His study in Mathematical optimization focuses on Stochastic optimization, Probabilistic-based design optimization and Robust optimization.

His research investigates the connection with Importance sampling and areas like Stochastic process which intersect with concerns in Mathematical model, Theory of computation, Decomposition, Numerical integration and Stochastic modelling. The Simplex algorithm study combines topics in areas such as Descent, Artificial intelligence and Combinatorics. His work deals with themes such as Big M method, Linear-fractional programming and Revised simplex method, which intersect with Calculus.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Linear Programming and Extensions

George Bernard Dantzig.

**(1963)**

9243 Citations

Linear Programming and Extensions

George Bernard Dantzig.

**(1963)**

9243 Citations

The Truck Dispatching Problem

G. B. Dantzig;J. H. Ramser.

Management Science **(1959)**

5904 Citations

The Truck Dispatching Problem

G. B. Dantzig;J. H. Ramser.

Management Science **(1959)**

5904 Citations

Decomposition Principle for Linear Programs

George B. Dantzig;Philip Wolfe.

Operations Research **(1960)**

2952 Citations

Decomposition Principle for Linear Programs

George B. Dantzig;Philip Wolfe.

Operations Research **(1960)**

2952 Citations

Solution of a Large-Scale Traveling-Salesman Problem

George B. Dantzig;D. Ray Fulkerson;Selmer M. Johnson.

Operations Research **(1954)**

2041 Citations

Solution of a Large-Scale Traveling-Salesman Problem

George B. Dantzig;D. Ray Fulkerson;Selmer M. Johnson.

Operations Research **(1954)**

2041 Citations

Linear Programming under Uncertainty

George B. Dantzig.

Management Science **(2004)**

1974 Citations

Linear Programming under Uncertainty

George B. Dantzig.

Management Science **(2004)**

1974 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Stanford University

University of Colorado Boulder

University of Florida

Harvard University

The University of Texas at Dallas

Stanford University

Carnegie Mellon University

Columbia University

University of Maryland, College Park

Cornell University

HEC Montréal

MIT

Korea Advanced Institute of Science and Technology

Qatar University

University of Ulm

University of Teacher Education Fukuoka

University of Zurich

Jaume I University

University of Padua

Sapienza University of Rome

Université Paris Cité

Columbia University

Duke University

University of Pittsburgh

Chinese Academy of Sciences

Columbia University

Something went wrong. Please try again later.