George B. Dantzig and systems optimization

DOI10.1016/j.disopt.2007.01.002zbMath1151.90021OpenAlexW2169925067MaRDI QIDQ951088

John A. Tomlin, Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.01.002

zbMATH Keywords

George Danztighistory of linear programmingLP test problemssystems optimization

Mathematics Subject Classification ID

Linear programming (90C05)

Uses Software

• NPSOL
• LPbook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An analysis of an available set of linear programming test problems
• The many facets of linear programming
• George B. Dantzig: a legendary life in mathematical programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• An Interview with George B. Dantzig: The Father of Linear Programming
• Smoothed analysis of algorithms
• Solving Real-World Linear Programs: A Decade and More of Progress
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• Robust implementation of Lemke's method for the linear complementarity problem
• Large-scale linearly constrained optimization
• Line Search Procedures for the Logarithmic Barrier Function
• The interior-point revolution in optimization: History, recent developments, and lasting consequences
• George B. Dantzig: Operations Research Icon
• Maintaining a Sparse Inverse in the Simplex Method
• Linear programming. Foundations and extensions