For faster navigation, this Iframe is preloading the Wikiwand page for Victor Klee.

Victor Klee

Victor Klee
Born(1925-09-18)September 18, 1925
DiedAugust 17, 2007(2007-08-17) (aged 81)
EducationPomona College
University of Virginia (Ph.D.)
Known for
Awards
Scientific career
FieldsMathematics
InstitutionsUniversity of Washington
Thesis Convex Sets in Linear Spaces  (1949)
Doctoral advisorEdward James McShane
Doctoral studentsBernd Sturmfels
Robert Phelps

Victor LaRue Klee, Jr. (September 18, 1925 – August 17, 2007) 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.

Life

[edit]

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] He died in Lakewood, Ohio.

Research

[edit]

Klee wrote more than 240 research papers. He proposed Klee's measure problem and the art gallery problem. 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.

Service and recognition

[edit]

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] In 1977 the MAA recognized Klee by presenting him with their Award for Distinguished Service to Mathematics.[4]

Notes

[edit]
  1. ^ a b Gritzmann, Peter; Sturmfels, Bernd (April 2008). "Victor L. Klee 1925–2007" (PDF). Notices of the American Mathematical Society. 55 (4). Providence, RI: American Mathematical Society: 467–473. ISSN 0002-9920.
  2. ^ Klee, Victor; Minty, George J. (1972). "How good is the simplex algorithm?". In Shisha, Oved (ed.). 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 0332165.
  3. ^ Klee, Victor (1971). "What is a convex set?". Amer. Math. Monthly. 78 (6): 616–631. doi:10.2307/2316569. JSTOR 2316569.
  4. ^ Botts, Truman (1977). "Award for Distinguished Service to Professor Victor Klee". The American Mathematical Monthly. 84 (2): 81–82. doi:10.1080/00029890.1977.11994293. ISSN 0002-9890.

Further reading

[edit]
[edit]
{{bottomLinkPreText}} {{bottomLinkText}}
Victor Klee
Listen to this article

This browser is not supported by Wikiwand :(
Wikiwand requires a browser with modern capabilities in order to provide you with the best reading experience.
Please download and use one of the following browsers:

This article was just edited, click to reload
This article has been deleted on Wikipedia (Why?)

Back to homepage

Please click Add in the dialog above
Please click Allow in the top-left corner,
then click Install Now in the dialog
Please click Open in the download dialog,
then click Install
Please click the "Downloads" icon in the Safari toolbar, open the first download in the list,
then click Install
{{::$root.activation.text}}

Install Wikiwand

Install on Chrome Install on Firefox
Don't forget to rate us

Tell your friends about Wikiwand!

Gmail Facebook Twitter Link

Enjoying Wikiwand?

Tell your friends and spread the love:
Share on Gmail Share on Facebook Share on Twitter Share on Buffer

Our magic isn't perfect

You can help our automatic cover photo selection by reporting an unsuitable photo.

This photo is visually disturbing This photo is not a good choice

Thank you for helping!


Your input will affect cover photo selection, along with input from other users.

X

Get ready for Wikiwand 2.0 🎉! the new version arrives on September 1st! Don't want to wait?