George B. Dantzig: a legendary life in mathematical programming

DOI10.1007/S10107-005-0674-4MaRDI QIDQ2583150zbMATH OpenOpenAlexDBLPWikidataFDO

Authors R. W. Cottle

Publication date 13 January 2006

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-005-0674-4

zbMATH Keywords

simplex method

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03) Mathematical programming (90C99)

Recommendations

• George B. Dantzig and systems optimization
• George Dantzig's impact on the theory of computation
• scientific article; zbMATH DE number 2061763
• Publication:4207877
• Hoàng Tuy (7 December 1927 -- 14 July 2019) -- in appreciation

Cites work

• A generalization of the linear complementarity problem
• An Interview with George B. Dantzig: The Father of Linear Programming
• Decomposition Principle for Linear Programs
• Formulating an objective for an economy
• scientific article; zbMATH DE number 3121281 (Why is no real title available?)
• scientific article; zbMATH DE number 3121292 (Why is no real title available?)
• scientific article; zbMATH DE number 3169929 (Why is no real title available?)
• scientific article; zbMATH DE number 3856810 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3069611 (Why is no real title available?)
• scientific article; zbMATH DE number 3086524 (Why is no real title available?)
• Linear Programming
• Linear Programming
• Linear programming under uncertainty
• On the Fundamental Lemma of Neyman and Pearson
• On the Non-Existence of Tests of "Student's" Hypothesis Having Power Functions Independent of \sigma
• On the shortest route through a network
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Programming of Interdependent Activities: II Mathematical Model
• The Decomposition Algorithm for Linear Programs
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

Cited in

(11)

• An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs
• Hoàng Tuy (7 December 1927 -- 14 July 2019) -- in appreciation
• Using vector divisions in solving the linear complementarity problem
• Orbituary: ``Ky Fan (1914--2010), he spent every waking moment thinking about mathematics
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
• scientific article; zbMATH DE number 3914273 (Why is no real title available?)
• Stable and 𝐿²-cohomology of arithmetic groups
• scientific article; zbMATH DE number 7075895 (Why is no real title available?)
• Edsger Wybe Dijkstra
• George B. Dantzig and systems optimization
• George Dantzig's impact on the theory of computation

This page was built for publication: George B. Dantzig: a legendary life in mathematical programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583150)