James B. Orlin

James B. Orlin
Born (1953-04-19) April 19, 1953
Fields Operations research
Institutions MIT Sloan School of Management
Alma mater University of Pennsylvania (BS 1974)
California Institute of Technology (MS 1976)
Stanford University (PhD 1981)
Doctoral advisor Arthur Fales Veinott
Doctoral students Charu C. Aggarwal
Notable awards INFORMS Fellow (2006)
Website
jorlin.scripts.mit.edu

James Berger Orlin (born April 19, 1953)[1] is an American operations researcher, the Edward Pennell Brooks Professor in Management and Professor of Operations Research at the MIT Sloan School of Management.[2]

Biography

Orlin did his undergraduate studies at the University of Pennsylvania, receiving a bachelor's degree in mathematics in 1974. He earned a masters degree in mathematics from the California Institute of Technology in 1976, and a Ph.D. in operations research from Stanford University in 1981 under the supervision of Arthur Fales Veinott, Jr.[1][2][3] He joined the MIT faculty as an assistant professor in 1979, and became the Brooks Professor in 1998.[1]

Selected works

He is the author of the book Network Flows: Theory, Algorithms, and Applications (with Thomas L. Magnanti and Ravindra K. Ahuja, Prentice Hall, 1993), for which he and his co-authors were the recipients of the 1993 Frederick W. Lanchester Prize of the Institute for Operations Research and the Management Sciences.[4]

Honors and awards

He is also a Fellow of INFORMS[5] and a Margaret MacVicar Faculty Fellow, MIT's highest teaching honor.[6]

References

  1. 1 2 3 Curriculum vitae, accessed 2011-03-05.
  2. 1 2 Faculty biography, Sloan School, accessed 2011-03-05.
  3. James Berger Orlin at the Mathematics Genealogy Project.
  4. Award recipients: James B. Orlin, INFORMS, accessed 2011-03-05.
  5. INFORMS Fellows: Class of 2006, accessed 2011-03-05.
  6. Thibault, Marie Y. (March 6, 2007), "MacVicar Day Celebrates Learning, MIT Professors", The Tech.

External links

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