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.

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.

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.

[3] In 1977, the MAA recognized Klee by presenting him with their Award for Distinguished Service to Mathematics.