I am an Assistant Professor in the School of Mathematical & Statistical Sciences at Clemson University (Subfaculty: Operations Research).
My research develops theoretically-grounded and computationally-scalable methods to improve the operations and planning of large-scale networked systems under nonconvexity, stochasticity, and decentralization, with electricity markets as a primary motivation. On the theoretical side, I study coordinating mechanisms in networked systems with provable performance guarantees and rigorous analysis, grounded in duality theory, discrete optimization, and conic programming methods. On the computational side, I develop novel decomposition and convex relaxation methods for mixed-integer nonlinear, stochastic, and robust optimization, enabling the solution of large-scale operations problems that were previously intractable.
I obtained my Ph.D. in Industrial Engineering at University of Toronto in 2021, advised by Merve Bodur. I received M.S. in Operations Research from Columbia University in 2017. I also visited Columbia University and worked on the DOE ARPA-E PERFORM project led by Daniel Bienstock. You can find my CV here.
Please contact me at: 
Note that I am not the only person called Cheng Guo at Clemson University. There is another Cheng Guo and he is a Ph.D. student in the School of Computing.
Methodologies: Mixed-integer linear and nonlinear programming, Conic programming, Stochastic and robust optimization, Game theory, Decomposition algorithms.
Application areas: Power systems, Market design and pricing, Healthcare.
Ohio State University, ISE Seminar, Columbus, OH (October, 2026)