1986
DOI: 10.1080/07468342.1986.11972971
|View full text |Cite
|
Sign up to set email alerts
|

An Interview with George B. Dantzig: The Father of Linear Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
7
0
6

Year Published

2009
2009
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(13 citation statements)
references
References 0 publications
0
7
0
6
Order By: Relevance
“…When working in large-dimension spaces we will heed also Dantzig's remark that "one's intuition in higher dimensional space is not worth a damn!" [5]. For purposes of quantitative analysis we will rely upon Gauss' Theorema Egregium [86] to analyze the Riemannian and Kählerian geometric properties of gabion manifolds.…”
Section: The Geometric Properties Of Gabion-kähler (Gk) Manifoldsmentioning
confidence: 99%
See 1 more Smart Citation
“…When working in large-dimension spaces we will heed also Dantzig's remark that "one's intuition in higher dimensional space is not worth a damn!" [5]. For purposes of quantitative analysis we will rely upon Gauss' Theorema Egregium [86] to analyze the Riemannian and Kählerian geometric properties of gabion manifolds.…”
Section: The Geometric Properties Of Gabion-kähler (Gk) Manifoldsmentioning
confidence: 99%
“…Here we recall that dim H is the (complex) dimension of the Hilbert space within which the efflorescent GK state-space manifold of (complex) dimension dim K is embedded (see Sections 2.6.4 and 2.11, and also (5), for discussion of how to calculate dim K).…”
Section: Quantum State Reconstruction From Sparse Random Projectionsmentioning
confidence: 99%
“…Dantzig and von Neumann observed that the Min-Max theorem is implied by strong linear programming duality [10], [2]. Dantzig also provided a candidate construction for the opposite implication [10], and this was also established some decades later [1].…”
Section: Introductionmentioning
confidence: 99%
“…Samuel Karlin conjectured in 1959 that fictitious play converges at rate O(t − 1 2 ) with respect to the number of steps t. We disprove this conjecture by showing that, when the payoff matrix of the row player is the n × n identity matrix, fictitious play may converge (for some tie-breaking) at rate as slow as Ω(t − 1 n ). † Supported by a Sloan Foundation fellowship, a Microsoft Research faculty fellowship and NSF Award CCF-0953960 (CAREER) and CCF-1101491.‡ Supported by ONR grant N00014-12-1-0999.Step 1: row chooses 1 column chooses 2 row chooses 1 column chooses 1Step 2: row chooses 2 column chooses 2 row chooses 1 column chooses 2Step 3: row chooses 2 column chooses 1 row chooses 2 column chooses 2Step 4: row chooses 2 column chooses 1 row chooses 2 column chooses 2Step 5: row chooses 1 column chooses 1 row chooses 2 column chooses 1 U (5) = [2, 3] T , V (5) = [3, 2] U (5) = [2, 3] T , V (5) = [2,3]…”
mentioning
confidence: 99%
See 1 more Smart Citation