James B. Orlin


James B. Orlin

Support Staff

Get in Touch



Academic Groups

Academic Area

Centers & Initiatives

James Orlin is the E. Pennell Brooks (1917) Professor in Management and a Professor of Operations Research at the MIT Sloan School of Management.

Orlin specializes in network and combinatorial optimization. He has helped to develop improved solution methodologies in airline scheduling, railroad scheduling, logistics, network design, telecommunications, inventory control, and marketing. Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written the award-winning textbook, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993).

Orlin holds a BA in mathematics from the University of Pennsylvania, an MA in mathematics from the California Institute of Technology, an MMath from the University of Waterloo, and a PhD in operations research from Stanford University.


Orlin receives Khachiyan Prize

Jim Orlin wins Test of Time Award

James Orlin is a co-winner of the Leonard G. Abraham Prize


"On the Power of Randomization in Network Interdiction."

Bertsimas, Dimitris, Ebrahim Nasrabadi and James B. Orlin. Operations Research Letters Vol. 44, No. 1 (2016): 114–120.

"Provably Near-Optimal LP-Based Policies for Revenue Management of Reusable Resources."

Levi, Retsef, and Ana Radovanovic. Operations Research Vol. 58, No. 2 (2010): 503-507. Appendix.

"A Technique for Speeding up the Solution of the Lagrangean Dual."

Bertsimas, Dimitris and James B. Orlin. Mathematical Programming Vol. 63, No. 1 (1994): 23-46.

"A Technique for Speeding up the Solution of the Lagrangean Dual."

Dimitris Bertsimas, and James B. Orlin. In Proceedings of the Second Conference on Integer Programming and Combinatorial Optimization, edited by Egon Balas, Gerard Cornujelos, and Rajgopal Kannan. Pittsburgh, PA: May 1992.

Load More