George Dantzig

Dantzig with President [[Gerald Ford]] in 1976 George Bernard Dantzig (; 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 Jerzy Neyman.

At his death, Dantzig was the professor emeritus of Transportation Sciences and Professor of Operations Research and of Computer Science at Stanford University. Provided by Wikipedia
Showing 1 - 7 results of 7 for search 'Dantzig, George Bernard, 1914-', query time: 0.02s Refine Results
  1. 1
    Compact city : a plan for a liveable urban environment/

    Compact city : a plan for a liveable urban environment/ by Dantzig, George Bernard, 1914-

    Published 1973
  2. 2
    Linear programming and extensions/

    Linear programming and extensions/ by Dantzig, George Bernard, 1914-

    Published 1963
  3. 3
    Studies in optimization/

    Studies in optimization/ by Dantzig, George Bernard, 1914-, Eaves, B. Curtis

    Published 1974
  4. 4
    The truck dispatching problem /

    The truck dispatching problem / by Dantzig, George Bernard, 1914-, Ramses, J. H.

  5. 5
    Linear programming /

    Linear programming / by Dantzig, George Bernard, 1914-, Thapa, Mukunde N.

    Published 1997
  6. 6
    Mathematics of the decision sciences /

    Mathematics of the decision sciences / by Dantzig, George Bernard, 1914-, Veinott, Arthur F.

    Published 1968
  7. 7
    Linear programming 1 : introduction / [cakera padat]

    Linear programming 1 : introduction / [cakera padat] by Dantzig, George Bernard, 1914-, Thapa, Mukunde N., Glynn, Peter

    Published 1997

Search Tools: