Victor Klee

Victor Klee in 1980

Victor L. Klee, Jr. (September 18, 1925, San Francisco – August 17, 2007, Lakewood, Ohio) was a mathematician specialising in convex sets, functional analysis, analysis of algorithms, optimization, and combinatorics. He spent almost his entire career at the University of Washington in Seattle.

Born in San Francisco, Vic Klee earned his B.A. degree in 1945 with high honors from Pomona College, majoring in mathematics and chemistry. He did his graduate studies, including a thesis on Convex Sets in Linear Spaces, and received his PhD in mathematics from the University of Virginia in 1949. After teaching for several years at the University of Virginia, he moved in 1953 to the University of Washington in Seattle, Washington, where he was a faculty member for 54 years.[1] Klee wrote more than 240 research papers. He proposed Klee's measure problem and the art gallery theorem. Kleetopes are also named after him, as is the Klee–Minty cube,[2] which shows that the simplex algorithm for linear programming does not work in polynomial time in the worst–case scenario.

Klee served as president of the Mathematical Association of America from 1971 to 1973.[1] In 1972 he won a Lester R. Ford Award.[3]

Notes

  1. 1 2 Gritzmann, Peter; Sturmfels, Bernd (April 2008). "Victor L. Klee 1925–2007" (PDF). Notices of the American Mathematical Society. Providence, RI: American Mathematical Society. 55 (4): 467–473. ISSN 0002-9920.
  2. ↑ Klee, Victor; Minty, George J. (1972). "How good is the simplex algorithm?". In Shisha, Oved. Inequalities III (Proceedings of the Third Symposium on Inequalities held at the University of California, Los Angeles, Calif., September 1–9, 1969, dedicated to the memory of Theodore S. Motzkin). New York-London: Academic Press. pp. 159–175. MR 332165.
  3. ↑ Klee, Victor (1971). What is a convex set?. Amer. Math. Monthly. 78. pp. 616–631. doi:10.2307/2316569.

Further reading

External links

This article is issued from Wikipedia - version of the 10/10/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.