Ph.D. Stanford University, 1971
4183 Etcheverry Hall
"In the 1980s algebraic, combinatorial, and geometric ideas led to a series of breakthroughs in mathematical programming that promise to provide a fertile and exciting area of research for years to come."
is a professor of the department of Industrial Engineering and Operations Research at the University of California at Berkeley. Professor Adler hold B.A in Economics and Statistics from the Hebrew University in Israel, M.Sc in Operations Research from the Technion in Israel and Ph.D in Operations Research from Stanford. His research interests are in optimization theory, financial engineering and combinatorial probability models.
- Interior Point Algorithms for Linear & Convex Programming Models
- Combinatorial & Geometrical Approaches to Mathematical Programming
- Computer Aided Scheduling & Routing
- Probabilistic Analysis of Mathematical Programming Algorithms
- "A Simplex Algorithm Whose Average Number of Steps is Bounded by Two Quadratic Functions of the Smaller Dimension," (with N. Megiddo),Journal of the Association of Computing Machinery, 1985
- "Interior Path Following Primal-Dual Algorithms" (with R. Monteiro), Mathematical Programming, 1989
- "Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Application to LP with Circulant Matrices," (with P. Beling),Mathematical Programming, 1992
Ph.D. Theses Supervised
- "The Economics of a Difference of Opinion: An Incentive Approach to Eliciting Probabilities," R. Shachter
- "Representation, Equivalence and the Geometry of Duality in Linear Programming," A. Sanstad.
- "On the Complexity of some Primal-Dual Linear Programming Pair," S.Cosares.