George B. Dantzig and systems optimization
type: Item
instance of: scholarly article
title: George B. Dantzig and systems optimization
zbMATH Open document ID: 1151.90021
author: Philip E. Gill
author: Walter Murray
author: Michael A. Saunders
author: John A. Tomlin
author: Margaret H. Wright
published in: Discrete Optimization
publication date: 2008-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5358778
zbMATH Keywords: George Danztig
zbMATH Keywords: systems optimization
zbMATH Keywords: history of linear programming
zbMATH Keywords: LP test problems
describes a project that uses: LPbook
describes a project that uses: NPSOL
MaRDI profile type: Publication
full work available at URL: j.disopt.2007.01.002
OpenAlex ID: W2169925067
cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
cites work: An Interview with George B. Dantzig: The Father of Linear Programming
cites work: Solving Real-World Linear Programs: A Decade and More of Progress
cites work: George B. Dantzig: Operations Research Icon
cites work: George B. Dantzig: a legendary life in mathematical programming
cites work: Q5611526
cites work: Q5588268
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3050157
cites work: Q4051879
cites work: An analysis of an available set of linear programming test problems
cites work: Line Search Procedures for the Logarithmic Barrier Function
cites work: Q3861172
cites work: Large-scale linearly constrained optimization
cites work: A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
cites work: Q4339096
cites work: Smoothed analysis of algorithms
cites work: The many facets of linear programming
cites work: Maintaining a Sparse Inverse in the Simplex Method
cites work: Robust implementation of Lemke's method for the linear complementarity problem
cites work: Linear programming. Foundations and extensions
cites work: The interior-point revolution in optimization: History, recent developments, and lasting consequences
cites work: Q4382667
DOI: 10.1016/J.DISOPT.2007.01.002
description: scientific article; zbMATH DE number 5358778