Tu banner alternativo

Jon Lee (mathematician)

The importance of Jon Lee (mathematician) in today's society is undeniable. Every day, Jon Lee (mathematician) becomes a topic of debate and reflection in different areas, whether in politics, science, entertainment or culture. Jon Lee (mathematician) awakens the interest and curiosity of people, who seek to understand its impact on their lives and the world around them. In this article, we will explore the various aspects related to Jon Lee (mathematician), from its origin to its evolution today. We will analyze its influence on our daily decisions, as well as on the development of society as a whole.

Tu banner alternativo

Jon Lee (born 1960) is an American mathematician and operations researcher, the G. Lawton and Louise G. Johnson Professor of Engineering at the University of Michigan.[1] He is known for his research in nonlinear discrete optimization and combinatorial optimization.[2]

Biography

Lee graduated from Stuyvesant High School in 1977. He did both his undergraduate and graduate studies at Cornell University, earning a bachelor's degree in 1981 and a Ph.D. in 1986 under the supervision of Robert G. Bland.[3] Lee was a faculty member at Yale University from 1985 until 1993, when he moved to the mathematics department at the University of Kentucky. From 2000 to 2011, he worked at the IBM Thomas J. Watson Research Center, after which he returned to academia at the University of Michigan.[2] From 2010 through 2012, Lee was chair of the INFORMS Optimization Society.[4] In 2018–2021, Lee was Editor-in-Chief of the journal Mathematical Programming, Series A.[5]

Books

Lee is the author of A First Course in Combinatorial Optimization (Cambridge University Press, 2004) and A First Course in Linear Optimization (Reex Press, 2013). He is co-author, with Marcia Fampa, of Maximum-Entropy Sampling: Algorithms and Application (Springer, 2022). He is co-editor of: Trends in Optimization (American Mathematical Society, 2004), Mixed Integer Nonlinear Programming (Springer, 2012), Integer Programming and Combinatorial Optimization (Lecture Notes in Computer Science, Vol. 8494; Springer, 2014), Special Issue: Integer Programming and Combinatorial Optimization, 2014 (Mathematical Programming, Series B. Issue 1-2, December 2015), and Combinatorial Optimization (Lecture Notes in Computer Science, Vol. 10856; Springer, 2018).

Awards and honors

In 2010, Lee and his co-authors won the ICS Prize of the INFORMS Computing Society for their work showing that many combinatorial feasibility problems could be recast as systems of polynomial equations in complex variables and then shown to be infeasible by applying Hilbert's Nullstellensatz and a wide variety of computational techniques.[6]

In 2013, Lee was elected as a Fellow of INFORMS.[7]

References

  1. ^ Summary of Personnel Actions, Regents of the University of Michigan, October 2011, retrieved 2012-02-25.
  2. ^ a b Faculty appointment dossier at Univ. of Michigan, September 2011, retrieved 2012-02-25.
  3. ^ Jonathan Lee at the Mathematics Genealogy Project
  4. ^ INFORMS Optimization Society, Officers, INFORMS, retrieved 2018-01-26.
  5. ^ Mathematical Programming (Springer).
  6. ^ INFORMS Computing Society Prize Archived 2010-10-20 at the Wayback Machine, INFORMS Computing Society, retrieved 2018-01-25.
  7. ^ INFORMS Fellows Class of 2013, INFORMS, retrieved 2018-01-25.
Wikious
Boobota
Sagapedia