Skip to main content

George B. Dantzig

  • Chapter
  • First Online:
Profiles in Operations Research

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 147))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Albers DJ, Alexanderson GL, Reid C (eds) (1990) George B. Dantzig. More mathematical people. Harcourt Brace Jovanovich, Boston, MA, pp 61–79

    Google Scholar 

  • Albers DJ, Reid C (1986) An interview with George B. Dantzig: the father of linear programming. Coll Math J 17(4):293–314

    Google Scholar 

  • Arrow K (2008) George B. Dantzig in the development of economic analysis. Discrete Optim 5(2):159–167

    Article  Google Scholar 

  • Balas E (2008) Recollections about George Dantzig. http://www2.informs.org/History/dantzig/rem_balas.htm. Accessed 28 Jul 2009

  • 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–18

    Google Scholar 

  • Cattell J (1949) American men of science, 8th edn. The Science Press, Lancaster, PA

    Google Scholar 

  • 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–51

    Article  Google Scholar 

  • Cottle RW (ed) (2003) The basic George B. Dantzig. Stanford University Press, Stanford, CA

    Google Scholar 

  • Cottle RW (2005) George B. Dantzig: operations research icon. Oper Res 53(6):892–898

    Article  Google Scholar 

  • Cottle R, Johnson E, Wets R (2007) George B. Dantzig (1914–2005). Notices Am Math Soc 54(3):344–362

    Google Scholar 

  • 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–192

    Article  Google Scholar 

  • 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–32

    Google Scholar 

  • 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–335

    Google Scholar 

  • 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–347

    Google Scholar 

  • 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–373

    Google Scholar 

  • Dantzig GB (1955) Linear programming under uncertainty. Manage Sci 1(3–4):197–206

    Article  Google Scholar 

  • Dantzig GB (1960a) On the significance of solving linear programs with some integer variables. Econometrica 28(1):30–44

    Article  Google Scholar 

  • Dantzig GB (1960b) On the shortest route through a network. Manage Sci 6(2):187–190

    Article  Google Scholar 

  • Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton, NJ

    Google Scholar 

  • Dantzig GB (1982) Reminiscences about the origins of linear programming. Oper Res Lett 1(2):43–48

    Article  Google Scholar 

  • Dantzig GB (1984) In our own image (unpublished manuscript)

    Google Scholar 

  • Dantzig GB (1988) Impact of linear programming on computer development. OR/MS Today 15(4):12–17

    Google Scholar 

  • Dantzig GB (1990) The diet problem. Interfaces 20(4):43–47

    Article  Google Scholar 

  • Dantzig GB (2002) Linear programming. Oper Res 50(1):42–47

    Article  Google Scholar 

  • 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–221

    Google Scholar 

  • Dantzig GB, Fulkerson DR, Johnson SM (1954) The solution of a large-scale traveling salesman problem. Oper Res 2(4):293–410

    Article  Google Scholar 

  • Dantzig GB, Glynn P (1990) Parallel processors for planning under uncertainty. Ann Oper Res 22(1–4):1–21

    Article  Google Scholar 

  • 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 19

    Google Scholar 

  • 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–195

    Google Scholar 

  • 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–23

    Google Scholar 

  • Dantzig GB, Saaty T (1973) Compact city. W. H. Freeman, San Francisco, CA

    Google Scholar 

  • Dantzig GB, Thapa M (1997) Linear programming: introduction. Springer, New York, NY

    Google Scholar 

  • Dantzig GB, Thapa M (2003) Linear programming: theory and extensions. Springer, New York, NY

    Google Scholar 

  • Dantzig GB, Van Slyke R (1967) Generalized upper bound techniques. J Comput Syst Sci 1:213–226

    Article  Google Scholar 

  • Dantzig GB, Wald A (1951) On the fundamental lemma of Neyman and Pearson. Ann Math Stat 22(1):87–93

    Article  Google Scholar 

  • Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8(1):101–111

    Article  Google Scholar 

  • Dantzig GB, Wolfe P (1961) Decomposition algorithm for linear programs. Econometrica 29(4):767–778

    Article  Google Scholar 

  • Dongarra J, Sullivan F (2000) The top 10 algorithms. Comput Sci Eng 2(1):22–23

    Article  Google Scholar 

  • Dorfman R (1984) The discovery of linear programming. Ann Hist Comput 5(3):283–295

    Article  Google Scholar 

  • Ferguson A, Dantzig GB (1956) The allocation of aircraft to routes—an example of linear programming under uncertain demand. Manage Sci 3:45–73

    Article  Google Scholar 

  • Fulkerson D, Dantzig GB (1955) Computations of maximal flows in networks. Naval Res Logistics Q 2:277–283

    Article  Google Scholar 

  • Gardner R (1990) L. V. Kantorovich: the price implications of optimal planning. J Econ Lit 28(June):638–648

    Google Scholar 

  • Gass SI (1989) Comments on the history of linear programming. IEEE Ann Hist Comput 11(2):147–151

    Google Scholar 

  • Gass SI (2002) The first linear-programming shoppe. Oper Res 50(1):61–68

    Article  Google Scholar 

  • Gass SI (2003) IFORS’ operational research hall of fame: George B. Dantzig. Int Transact Oper Res 10(2):191–193

    Article  Google Scholar 

  • Gill P, Murray W, Saunders M, Tomlin J, Wright M (2008) George B. Dantzig and systems optimization. Discrete Optim 5(2):151–158

    Article  Google Scholar 

  • Grötschel M, Nemhauser G (2008) George B. Dantzig’s contributions to integer programming. Discrete Optim 5(2):168–173

    Article  Google Scholar 

  • Hoffman A (2008) Editorial: a special issue in memory of George B. Dantzig. Discrete Optim 5(2):145–150. http://www2.informs.org/History/dantzig/rem_hoffman.htm. Accessed 3 Nov 2009)

    Article  Google Scholar 

  • Hoffman A, Mannos M, Sokolowsky D, Wiegmann N (1953) Computational experience in solving linear programs. SIAM J 1(1):17–33

    Google Scholar 

  • IIASA (2009) http://www.iiasa.ac.at/docs/IIASA_Info.html. Accessed 5 Jan 2009)

  • Infanger G (1992) Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Ann Oper Res 39(1–4):69–95

    Article  Google Scholar 

  • Infanger G (1994) Planning under uncertainty: solving large-scale stochastic linear programs. The Scientific Press Series, Boyd & Fraser, Danvers, MA

    Google Scholar 

  • Johnson LR (2006) Coming to grips with the UNIVAC. Ann Hist Comput 28(5):32–42

    Article  Google Scholar 

  • Kantorovich LV (1939) Mathematical methods in the organization and planning of production. Publication House, Leningrad University, Leningrad, Russia

    Google Scholar 

  • Kantorovich LV (1942) On the translocation of masses. Proc Natl Acad Sci USSR 37(7–7):227–230

    Google Scholar 

  • Kantorovich LV (1958) English translation of Kantorovich (1942). Manage Sci 5(1):1–4

    Article  Google Scholar 

  • Kantorovich LV (1959) The best use of economic resources (in Russian). USSR Academy of Sciences, Moscow. (English translation, Pergamon Press, Oxford, 1965)

    Google Scholar 

  • Kantorovich LV (1960) English translation of Kantorovich (1939). Manage Sci 6(4):363–422

    Article  Google Scholar 

  • Kantorovich LV (1965) The best use of economic resources [English translation of (Kantorovich 1959)]. Pergamon Press, Oxford, England

    Google Scholar 

  • 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–45

    Google Scholar 

  • Karp R (2008) George B. Dantzig’s impact on the theory of computation. Discrete Optim 5(2):174–185

    Article  Google Scholar 

  • Klass J (2009) Personal communication

    Google Scholar 

  • Koopmans TC (ed) (1951) Activity analysis of production and allocation: proceedings of a conference. Wiley, New York, NY

    Google Scholar 

  • Koopmans TC (1957) Three essays on the state of economic science. McGraw-Hill, New York, NY

    Google Scholar 

  • Koopmans TC (1960) A note about Kantorovich’s paper, “Mathematical Methods of Organizing and Planning Production.” Manage Sci 6(4):363–365

    Article  Google Scholar 

  • Kuhn H (2008) 57 Years of close encounters with George. http://www2.informs.org/History/dantzig/articles_kuhn.html. Accessed 9 June 2009

  • 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, NY

    Google Scholar 

  • Lustig I (2000) Optimization trailblazers: interview with George Dantzig (text and video). http://www.e-optimization.com/directory/trailblazers/dantzig. Accessed 2 Aug 2009

  • 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–7

    Google Scholar 

  • Mathematical Genealogy Project (2009) www.genealogy.ams.org. Accessed 5 Jan 2009

  • Orchard-Hays W (1968) Advanced linear-programming computing techniques. McGraw-Hill, New York, NY

    Google Scholar 

  • Orden A (1952) Solution of systems of linear inequalities on a digital computer. In: Proceedings of the association for computing machinery, May:91–95

    Google Scholar 

  • Orden A (1993) LP from the ‘40 s to the ‘90 s. Interfaces 23(5):2–12

    Article  Google Scholar 

  • Snopes (2009) www.snopes.com/college/homework/unsolvable.asp. Accessed 27 Jul 2009)

  • Steiner R (1992) Memories of IIASA, irreverent and reverent. IIASA Options, June 17

    Google Scholar 

  • Thapa M (2009) Personal communication

    Google Scholar 

  • 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–14

    Google Scholar 

  • 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–215

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Saul I. Gass .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gass, S.I. (2011). George B. Dantzig. In: Assad, A., Gass, S. (eds) Profiles in Operations Research. International Series in Operations Research & Management Science, vol 147. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6281-2_13

Download citation

Publish with us

Policies and ethics