Oleg A. Prokopyev is Professor of Quantitative Business Administration at the University of Zurich,
which he joined in 2023.
Previously, he was Professor of Industrial Engineering at the University of Pittsburgh. He holds
a PhD in Industrial and Systems Engineering from the University of Florida and bachelor’s and master’s degrees in Applied Mathematics and Physics from the Moscow Institute of Physics and Technology.
His research focuses on operations research and optimization, developing models and methods to improve operational planning and support managerial decision-making under uncertainty. He served as
Co-Editor-in-Chief of Optimization Letters from 2013 to 2026. His work has been recognized with the Pierskalla Best Paper Award by the Health Applications Society of INFORMS, the INFORMS ENRE Best Publication Award in Environment and Sustainability, and a Young Investigator Research Program (YIP) Award from the U.S. Air Force Office of Scientific Research.
Curriculum Vitae (PDF, 130 KB)
Selected Publications
On Local Search in Bilevel Mixed-Integer Linear Programming
E. Clemente, O.A. Prokopyev, “On Local Search in Bilevel Mixed-Integer Linear Programming,” Mathematical Programming, accepted for publication, 2026.
On the Complexity of Finding Locally Optimal Solutions in Bilevel Linear Optimization
O.A. Prokopyev, T.K. Ralphs, “On the Complexity of Finding Locally Optimal Solutions in Bilevel Linear Optimization,” Operations Research, Vol. 74/4 (2026), pp. 1983–1994.
Optimal Condition-Based Maintenance via a Mobile Maintenance Resource
S. Sanoubar, B. de Jonge, L.M. Maillart, O.A. Prokopyev, “Optimal Condition-Based Maintenance via a Mobile Maintenance Resource,” Transportation Science, Vol. 57/6 (2023), pp. 1646–1670.
Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
J. Lamperski, O.A. Prokopyev, L. Wrabetz, “Min-max-min optimization with smooth and strongly convex objectives,” SIAM Journal on Optimization, Vol. 33/3 (2023), pp. 2435–2456.
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
X. Shi, O.A. Prokopyev, T.K. Ralphs, “Mixed Integer Bilevel Optimization with a k-optimal Follower: A Hierarchy of Bounds,” Mathematical Programming Computation, Vol. 15/1 (2023), pp. 1–51.
Sequence independent lifting for a set of submodular maximization problems
X. Shi, O.A. Prokopyev, B. Zeng, “Sequence independent lifting for a set of submodular maximization problems,” Mathematical Programming, Vol. 196/1-2 (2022), pp. 69–114.
Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
O. Tavaslioglu, O.A. Prokopyev, A.J. Schaefer, “Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function,” Operations Research, Vol. 67/6 (2019), pp. 1659–1677.
Sequential Interdiction with Incomplete Information and Learning
J.S. Borrero, O.A. Prokopyev, D. Saure, “Sequential Interdiction with Incomplete Information and Learning,” Operations Research, Vol. 67/1 (2019), pp. 72–89.
Dynamic Abandon/Extract Decisions for Failed Cardiac Leads
A. Khojandi, L.M. Maillart, O.A. Prokopyev, M.S. Roberts, and S. Saba, “Dynamic Abandon/Extract Decisions for Failed Cardiac Leads,” Management Science, Vol. 64/2 (2018), pp. 633–651.
On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming
A.C. Trapp, O.A. Prokopyev, A.J. Schaefer, “On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming,” Operations Research, 61/2 (2013), pp. 498–511.