George B. Dantzig

  • Saul I. GassEmail author
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 147)


The influenceof George B. Dantzig on the field of operations research (OR) is best reflected by noting that the he was the first recipient of the Operations Research Society of America (ORSA) and The Institute of Management Sciences (TIMS) prestigious John von Neumann Theory Prize, an award given annually to a scholar who has made fundamental, sustained contributions to theory in OR and management science (MS). He was the first inductee into the International Federation of Operational Research Societies’ (IFORS) OR Hall of Fame. He is regarded as the father of linear programming (LP). He was awarded the President’s National Medal of Science in 1975 by President Ford. He served as president of TIMS in 1966.


Operation Research Nobel Prize Linear Programming Problem Traveling Salesman Problem Simplex Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Albers DJ, Alexanderson GL, Reid C (eds) (1990) George B. Dantzig. More mathematical people. Harcourt Brace Jovanovich, Boston, MA, pp 61–79Google Scholar
  2. Albers DJ, Reid C (1986) An interview with George B. Dantzig: the father of linear programming. Coll Math J 17(4):293–314Google Scholar
  3. Arrow K (2008) George B. Dantzig in the development of economic analysis. Discrete Optim 5(2):159–167CrossRefGoogle Scholar
  4. Balas E (2008) Recollections about George Dantzig. Accessed 28 Jul 2009
  5. Balinksi ML (1991) Mathematical programming: journal, society, recollections. In: Lenstra JK, Rinnooy Kan AHG, Schrijver A (eds) History of mathematical programming. North-Holland, Amsterdam, pp 5–18Google Scholar
  6. Cattell J (1949) American men of science, 8th edn. The Science Press, Lancaster, PAGoogle Scholar
  7. Cooper WW (2002) Abraham Charnes and W. W. Cooper (et al.): a brief history of a long collaboration in developing industrial uses of linear programming. Oper Res 50(1):35–51CrossRefGoogle Scholar
  8. Cottle RW (ed) (2003) The basic George B. Dantzig. Stanford University Press, Stanford, CAGoogle Scholar
  9. Cottle RW (2005) George B. Dantzig: operations research icon. Oper Res 53(6):892–898CrossRefGoogle Scholar
  10. Cottle R, Johnson E, Wets R (2007) George B. Dantzig (1914–2005). Notices Am Math Soc 54(3):344–362Google Scholar
  11. Dantzig GB (1940) On the non-existence of tests for Student’s hypothesis involving power functions independent of sigma. Ann Math Stat 11(2):186–192CrossRefGoogle Scholar
  12. Dantzig GB (1951a). The programming of interdependent activities: mathematical model. In: Koopmans TC (ed) Activity analysis of production and allocation: proceedings of a conference. Wiley, New York, NY, pp 19–32Google Scholar
  13. Dantzig GB (1951b) A proof of the equivalence of the programming problem and the game problem. In: Koopmans TC (ed) Activity analysis of production and allocation. Wiley, New York, NY, pp 330–335Google Scholar
  14. Dantzig GB (1951c) Maximization of a linear function of variables subject to linear inequalities. In: Koopmans TC (ed) Activity analysis of production and allocation. Wiley, New York, NY, pp 339–347Google Scholar
  15. Dantzig GB (1951d) Application of the simplex method to a transportation problem. In: Koopmans TC (ed) Activity analysis of production and allocation. Wiley, New York, NY, pp 359–373Google Scholar
  16. Dantzig GB (1955) Linear programming under uncertainty. Manage Sci 1(3–4):197–206CrossRefGoogle Scholar
  17. Dantzig GB (1960a) On the significance of solving linear programs with some integer variables. Econometrica 28(1):30–44CrossRefGoogle Scholar
  18. Dantzig GB (1960b) On the shortest route through a network. Manage Sci 6(2):187–190CrossRefGoogle Scholar
  19. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton, NJGoogle Scholar
  20. Dantzig GB (1982) Reminiscences about the origins of linear programming. Oper Res Lett 1(2):43–48CrossRefGoogle Scholar
  21. Dantzig GB (1984) In our own image (unpublished manuscript)Google Scholar
  22. Dantzig GB (1988) Impact of linear programming on computer development. OR/MS Today 15(4):12–17Google Scholar
  23. Dantzig GB (1990) The diet problem. Interfaces 20(4):43–47CrossRefGoogle Scholar
  24. Dantzig GB (2002) Linear programming. Oper Res 50(1):42–47CrossRefGoogle Scholar
  25. Dantzig GB, Fulkerson DR (1956) On the max-flow min-cut theorem of networks. In: Kuhn H, Tucker A (eds) Linear inequalities and related systems. Princeton University Press, Princeton, NJ, pp 215–221Google Scholar
  26. Dantzig GB, Fulkerson DR, Johnson SM (1954) The solution of a large-scale traveling salesman problem. Oper Res 2(4):293–410CrossRefGoogle Scholar
  27. Dantzig GB, Glynn P (1990) Parallel processors for planning under uncertainty. Ann Oper Res 22(1–4):1–21CrossRefGoogle Scholar
  28. Dantzig GB, Orchard-Hays W (1953) Notes on linear programming: part V—alternate algorithm for the revised simplex method using product form for the inverse. The RAND Corporation, Research Memorandum RM–1268, November 19Google Scholar
  29. Dantzig GB, Orden A, Wolfe P (1955) The generalized simplex method for minimizing a linear form under linear inequality restraints. Pac J Math 5(2):183–195Google Scholar
  30. Dantzig GB, Parikh S (1976) On a pilot linear programming model for assessing physical impact on the economy of a changing energy picture. In: Roberts F (ed) Energy: mathematics and models, proceedings of a SIMS conference on energy, 7–11 July 1975. SIAM, Philadelphia, PA, pp 1–23Google Scholar
  31. Dantzig GB, Saaty T (1973) Compact city. W. H. Freeman, San Francisco, CAGoogle Scholar
  32. Dantzig GB, Thapa M (1997) Linear programming: introduction. Springer, New York, NYGoogle Scholar
  33. Dantzig GB, Thapa M (2003) Linear programming: theory and extensions. Springer, New York, NYGoogle Scholar
  34. Dantzig GB, Van Slyke R (1967) Generalized upper bound techniques. J Comput Syst Sci 1:213–226CrossRefGoogle Scholar
  35. Dantzig GB, Wald A (1951) On the fundamental lemma of Neyman and Pearson. Ann Math Stat 22(1):87–93CrossRefGoogle Scholar
  36. Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8(1):101–111CrossRefGoogle Scholar
  37. Dantzig GB, Wolfe P (1961) Decomposition algorithm for linear programs. Econometrica 29(4):767–778CrossRefGoogle Scholar
  38. Dongarra J, Sullivan F (2000) The top 10 algorithms. Comput Sci Eng 2(1):22–23CrossRefGoogle Scholar
  39. Dorfman R (1984) The discovery of linear programming. Ann Hist Comput 5(3):283–295CrossRefGoogle Scholar
  40. Ferguson A, Dantzig GB (1956) The allocation of aircraft to routes—an example of linear programming under uncertain demand. Manage Sci 3:45–73CrossRefGoogle Scholar
  41. Fulkerson D, Dantzig GB (1955) Computations of maximal flows in networks. Naval Res Logistics Q 2:277–283CrossRefGoogle Scholar
  42. Gardner R (1990) L. V. Kantorovich: the price implications of optimal planning. J Econ Lit 28(June):638–648Google Scholar
  43. Gass SI (1989) Comments on the history of linear programming. IEEE Ann Hist Comput 11(2):147–151Google Scholar
  44. Gass SI (2002) The first linear-programming shoppe. Oper Res 50(1):61–68CrossRefGoogle Scholar
  45. Gass SI (2003) IFORS’ operational research hall of fame: George B. Dantzig. Int Transact Oper Res 10(2):191–193CrossRefGoogle Scholar
  46. Gill P, Murray W, Saunders M, Tomlin J, Wright M (2008) George B. Dantzig and systems optimization. Discrete Optim 5(2):151–158CrossRefGoogle Scholar
  47. Grötschel M, Nemhauser G (2008) George B. Dantzig’s contributions to integer programming. Discrete Optim 5(2):168–173CrossRefGoogle Scholar
  48. Hoffman A (2008) Editorial: a special issue in memory of George B. Dantzig. Discrete Optim 5(2):145–150. Accessed 3 Nov 2009)CrossRefGoogle Scholar
  49. Hoffman A, Mannos M, Sokolowsky D, Wiegmann N (1953) Computational experience in solving linear programs. SIAM J 1(1):17–33Google Scholar
  50. IIASA (2009) Accessed 5 Jan 2009)
  51. Infanger G (1992) Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Ann Oper Res 39(1–4):69–95CrossRefGoogle Scholar
  52. Infanger G (1994) Planning under uncertainty: solving large-scale stochastic linear programs. The Scientific Press Series, Boyd & Fraser, Danvers, MAGoogle Scholar
  53. Johnson LR (2006) Coming to grips with the UNIVAC. Ann Hist Comput 28(5):32–42CrossRefGoogle Scholar
  54. Kantorovich LV (1939) Mathematical methods in the organization and planning of production. Publication House, Leningrad University, Leningrad, RussiaGoogle Scholar
  55. Kantorovich LV (1942) On the translocation of masses. Proc Natl Acad Sci USSR 37(7–7):227–230Google Scholar
  56. Kantorovich LV (1958) English translation of Kantorovich (1942). Manage Sci 5(1):1–4CrossRefGoogle Scholar
  57. Kantorovich LV (1959) The best use of economic resources (in Russian). USSR Academy of Sciences, Moscow. (English translation, Pergamon Press, Oxford, 1965)Google Scholar
  58. Kantorovich LV (1960) English translation of Kantorovich (1939). Manage Sci 6(4):363–422CrossRefGoogle Scholar
  59. Kantorovich LV (1965) The best use of economic resources [English translation of (Kantorovich 1959)]. Pergamon Press, Oxford, EnglandGoogle Scholar
  60. Kantorovich LV (1990) My journey in science. In: Leifman LJ (ed) Functional analysis, optimization, and mathematical economics, Oxford University Press, New York, NY, pp 8–45Google Scholar
  61. Karp R (2008) George B. Dantzig’s impact on the theory of computation. Discrete Optim 5(2):174–185CrossRefGoogle Scholar
  62. Klass J (2009) Personal communicationGoogle Scholar
  63. Koopmans TC (ed) (1951) Activity analysis of production and allocation: proceedings of a conference. Wiley, New York, NYGoogle Scholar
  64. Koopmans TC (1957) Three essays on the state of economic science. McGraw-Hill, New York, NYGoogle Scholar
  65. Koopmans TC (1960) A note about Kantorovich’s paper, “Mathematical Methods of Organizing and Planning Production.” Manage Sci 6(4):363–365CrossRefGoogle Scholar
  66. Kuhn H (2008) 57 Years of close encounters with George. Accessed 9 June 2009
  67. Leifman L (ed) (1990) Functional analysis, optimization and mathematical economics: a collection of papers dedicated to the memory of Leonid Vital’evich Kantorovich. Oxford University Press, New York, NYGoogle Scholar
  68. Lustig I (2000) Optimization trailblazers: interview with George Dantzig (text and video). Accessed 2 Aug 2009
  69. Makarov V, Sobolev S (1990) Academician L. V. Kantorovich. In: Leifman LJ (ed) Functional analysis, optimization, and mathematical economics. Oxford University Press, New York, NY, pp 1–7Google Scholar
  70. Mathematical Genealogy Project (2009) Accessed 5 Jan 2009
  71. Orchard-Hays W (1968) Advanced linear-programming computing techniques. McGraw-Hill, New York, NYGoogle Scholar
  72. Orden A (1952) Solution of systems of linear inequalities on a digital computer. In: Proceedings of the association for computing machinery, May:91–95Google Scholar
  73. Orden A (1993) LP from the ‘40 s to the ‘90 s. Interfaces 23(5):2–12CrossRefGoogle Scholar
  74. Snopes (2009) Accessed 27 Jul 2009)
  75. Steiner R (1992) Memories of IIASA, irreverent and reverent. IIASA Options, June 17Google Scholar
  76. Thapa M (2009) Personal communicationGoogle Scholar
  77. Wood MK (1952) Research program of Project SCOOP. In: Orden A, Goldstein L (eds) Proceedings symposium on linear inequalities and programming, directorate of management analysis service, Comptroller, Headquarters, U. S. Air Force, Washington, DC, pp 3–14Google Scholar
  78. Wood MK, Geisler MA (1951) Development of dynamic models for program planning. In: Koopmans TC (ed) Activity analysis of production and allocation: proceedings of a conference. Wiley, New York, NY, pp 189–215Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege ParkUSA

Personalised recommendations