Some 1948 correspondence between Dantzig and Von Neumann
Located in the Library of Congress
Scans from the library
My collection of rare pdf's.
Klee & Minty (1972) How Good Is the Simplex Algorithm?
Scanned from Inequalities : III : proceedings of the 3rd Symposium on inequalities held in Los Angeles, Sept. 1-9, 1969, edited by Oved Shisha. Pages 159-175. Sometimes cited as Klee & Minty, How Good Is the Simplex Method?, 1970, Technical Report No. TR-22. Washington Univ Seattle Dept. of Mathematics.
Borgwardt (1977) Untersuchungen zur Asymptotik der mittleren Schrittzahl von Simplexverfahren in der linearen Optimierung
PhD thesis of K.H. Borgwardt. Scanned from the physical copy in the CWI library.
Kantorovich (1987) My journey in science
Borgwardt & Joas (1991) Cycling Examples for the Shadow Vertex Algorithm
I got this through snail mail from K.H. Borgwardt. My copy is labeled as Schwerpunktprogramm der Deutschen Forschungsgemeinschaft, Report No. 336.
Borgwardt & Joas (1992) Verbesserungen in der Laufzeitsanalyse des Simplexverfahrens
I got this through snail mail from K.H. Borgwardt. My copy is labeled as Schwerpunktprogramm der Deutschen Forschungsgemeinschaft, Report No. 419.
Fischer (1998) Zweidimensionale Projektionen von linearen Programmen
Master thesis of Stefan Fischer at TU Berlin, supervised by Günter Ziegler. Text in German, scanned from a physical copy in Ziegler's office. Plots were sent to me by Ziegler.
Schnalzger (2014) Linear Optimization with the shadow-vertex-algorithm in the context of probabilistic investigations
K.H. Borgwardt used to host this on his website, but the link broke. Original in German, translation by K.H. Borgwardt.
Mike Jonas (2023) Linear Programming - my role at BP
I contacted Mike through Facebook, and he was generous enough to write down his recollections of working under Paula Harris in the 1960s.