George B. Dantzig: a legendary life in mathematical programming
From MaRDI portal
Publication:2583150
DOI10.1007/s10107-005-0674-4zbMath1085.01020OpenAlexW2077320679WikidataQ53931303 ScholiaQ53931303MaRDI QIDQ2583150
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
Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03) Mathematical programming (90C99)
Related Items
A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps, An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs, Using vector divisions in solving the linear complementarity problem, George B. Dantzig and systems optimization, Stable and 𝐿²-cohomology of arithmetic groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formulating an objective for an economy
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- On the Shortest Route Through a Network
- Linear Programming under Uncertainty
- An Interview with George B. Dantzig: The Father of Linear Programming
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- Linear Programming
- Linear Programming
- A generalization of the linear complementarity problem
- On the Non-Existence of Tests of "Student's" Hypothesis Having Power Functions Independent of $\sigma$
- Programming of Interdependent Activities: II Mathematical Model
- On the Fundamental Lemma of Neyman and Pearson
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
