He taught at Johns Hopkins University and the University of Maryland where he was chair of the mathematics department. Tobias was a student of the classics and a wonderful expositor of mathematics. To keep George from bothering him, Tobias kept feeding George thousands of geometry problems that helped George develop his analytical power. Although he had only one graduate course in statistics, George qualified for the Civil Service as a junior statistician and, in , accepted a job at the U.
Bureau of Labor Statistics in Washington, D. Berkeley, all of which caused him to change his view about statistics. George wrote to Neyman about pursuing a Ph. George and Anne moved to Berkeley in At that time, statistics was part of the Berkeley mathematics department, and although George only took two statistics courses, both from Neyman, his dissertation was in statistics.
Here is where the legend begins. After a few days of struggling, George turned his answers in. About six weeks later, at 8 a. Read it so I can send it out right away for publication. In June , prior to defending his dissertation, George accepted a job in Washington, D. This delayed him from receiving his doctorate in mathematics from Berkeley until Although offered a teaching position at Berkeley at that time, he decided to stay at the Pentagon where he became the mathematical advisor to the comptroller of the newly established Department of the Air Force.
The outcomes of this decision have been momentous: setting O. His insight enabled him to state mathematically — for the first time — a wide class of practical and important problems that fell into the newly defined linear-programming structure. This was accomplished by July By the end of that summer, George had developed the simplex method for solving such problems. Both the linear programming model and the simplex method were tested and proven — the linear programming primal-dual problems and their relationship via the simplex algorithm were stated and proven; the development of the simplex transportation algorithm, the equivalence between linear programming and zero-sum two-person games was established, as well as the application of linear programming to a wide range of planning and operational Air Force problems.
WHILE AT RAND, working alone or with a stellar cast of co-authors, George furthered linear programming as an important applied and mathematically sound approach for analyzing a wide range of real-world decision problems.
His RAND research included development and analysis of the decomposition principle, discrete variable applications, knapsack problem, network, and shortest route procedures, traveling salesman problem, revised simplex method, stochastic programming and much more. In , he began his illustrious academic career as a professor of engineering science and chairman of the Operations Research Center, University of California, Berkeley.
He moved to Stanford University in as a professor of operations research and computer science and was appointed the C. Criley Endowed Chair in Transportation in He retired in as professor emeritus but taught and maintained an active research agenda until the fall of George also served as a consultant to a number of major companies. Students and researchers will find much of value in it: a historical discussion of how the field first developed, the basic elements of linear programming, and the remarkable mathematical and applied extensions of the field.
More recently, George and Mukund Thapa coauthored a two-volume comprehensive overview of the current status of the field. George authored or co-authored seven books and more than papers. Two stories of his IIASA days illustrate his innate curiosity and interest in solving real-world problems. I cannot imagine that it is advantageous to have such a length.
Could you please find out what is in the truck, where it came from, what route it took, and how it got around corners? The legacy of George goes way beyond his research and teaching.
It includes his friendship, his mentoring, his unselfishness with his time and ideas, the more than 50 Ph. IN , Tjalling C. George Bernard Dantzig was born in Portland, Ore. His father was Tobias Dantzig, a prominent Latvian mathematician who studied at the Sorbonne in Paris and married before immigrating with his wife to the United States in George Dantzig showed an early interest in mathematics, especially geometry, and studied at the University of Maryland, where his father was a professor.
He later said his mission was to help create order in aircraft-supply flow lines. After the war, he returned to Berkeley and finished his PhD work, continuing his studies with mathematician Jerzy Neyman. Their relationship became legend in the math world. I copied them down. He told me to throw [the homework] on his desk. Early one morning about six weeks later, Dantzig found Neyman banging excitedly on the front door of his apartment. What Dantzig had copied off the blackboard was not homework but examples of two famous unsolved problems in statistics.
Dantzig had solved one, and Neyman wanted to send out one of his papers for immediate publication. After earning his doctorate, Dantzig returned to Washington to work for what had by then become the Air Force. His job was mechanizing the planning process. It was during this period that he discovered that linear programs could be used to solve a wide array of planning issues.
His creation of the simplex method and the development of the modern use of computer research made complicated equations much easier and faster to solve.
For instance, they allowed industry to quickly compare the several factors involved in interdependent courses of action. In the early s, Dantzig started working for Rand Corp. Six years later he moved on to Stanford as professor of operations research and computer science. He retired in
0コメント