Mathematical Programming

Links and References

Bixby R. E. (2002) Solving Real-World Linear Problems: A Decade and More of Progress. Operations Research, 50(1): 3-15. (link)

Bixby R. E. (2012) A Brief History of Linear and Mixed-Integer Programming Computation. In Grötschel, M. ed. Documenta Mathematica, Extra Volume "Optimization Stories" 107-121. (link)

Cook W. (2012) Markowitz and Manne + Eastman + Land and Doig = Branch and Bound. In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 227-238. (link)

Cooper W. W. (2002) Abraham Charnes and W. W. Cooper (et al.): A Brief History of a Long Collaboration in Developing Industrial Uses of Linear Programming. Operations Research, 50(1): 35-41. (link)

Cornuéjols, G. (2012) The Ongoing Story of Gomory Cuts.  In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 221-226. (link)

Cottle, R. W. (2012)  William Karush and the KKT Theorem. In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 255-269. (link)

Dantzig G. B. (1987) Origins of the Simplex Method.  Technical Report SOL 87-5, Systems Optimization Laboratory, Stanford University, Stanford CA (link)

Fourer, R (2012) On the Evolution of Optimization Modeling Systems.  In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 377-388. (link)

Gass S. I. (2002) The First Linear-Programming Shoppe. Operations Research, 50(1): 61-68. (link)

Giorgi G. and Kjeldsen T.H., editors (2014). Traces and emergence of nonlinear programming. Basel: Birkhäuser. (e-Book link

Gomory R. E. (2002) Early Integer Programming. Operations Research, 50(1): 78-81. (link)

Grötschel, M. (2012), ed. Documenta Mathematica, Extra Volume "Optimization Stories"  460 pages. Berlin, 2012.  (link)

Johnson, D. S. (2012) A Brief History of NP-Completeness, 1954-2012. In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 359-376. (link)

Kjeldsen TH (2000) A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: The impact of World War II. Historia Math. 27(4):331–361.

Klein, J. L. (2013) The Bounded Rationality of Cold War Operations Research, in Erickson, Klein et al How Reason Almost Lost Its Mind: The Strange Career of Cold War Rationality, University of Chicago Press, Chicago.

Lenstra J. K., Kan Rinnooy A. H. G., & Schrijver A. (1991) History of Mathematical Programming: A Collection of Personal Reminiscences. CWI: Amsterdam.

Möhring, R. H. (2012) D. Ray Fulkerson and Project Scheduling.  In Grötschel, M. ed. Documenta Mathematica, Extra Volume "Optimization Stories" 211-219. (link)

Nemhauser G. L. (2012) Column Generation for Linear and Integer programming.  In Grötschel, M. ed. Documenta Mathematica, Extra Volume "Optimization Storieslink" 65-73. (link)

Orden, A & Goldstein, L.  eds. (1952) Symposium on Linear Inequalities and Programming, Washington D.C. June 14-16, 1951.  Project SCOOP, report No. 10. Planning Research Division, Director of Management Analysis Service, Comptroller, Headquarters, U. S. Air Force. Washington, DC, April 1, 1952. 192 pages.  (link)

Pulleyblank, W R (2012) Edmonds, Matching and the Birth of Polyhedral Combinatorics. In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 181-197. (link)

Schrijver, A (2012) On the History of the Shortest Path Problem.  In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 169-180. (link)

Shanno, D (2012) Who Invented the Interior-Point Method? In Grötschel, M. ed. Documenta MathematicaExtra Volume "Optimization Stories" 55-64. (link)

Wolfe, Philip (undated) The Mathematical Programming Society: A History

Associated Historic Individuals