photo
Office: Martin O-321
Phone: (864) 656-5226
Email: agupte@clemson.edu
Fax: (864) 656-5230

Akshay Gupte

Position:
Assistant Professor
Students:
Education:
PhD in Operations Research from Georgia Institute of Technology, 2012
MS in Industrial Engineering from University of Arizona, 2007
BS in Production Engineering from VJTI, University of Mumbai, 2005
Professional Research Interests
Discrete Optimization, Mixed Integer Nonlinear Programming
Other Professional Activities
Upcoming Events: 
  • NemFest 2017 at Georgia Tech, Atlanta
  • SIAM Conference on Optimization OP17, Vancouver
  • MIP 2017, Montreal
  • IPCO 2017, Waterloo
  • SIAM Conference on Applied Algebraic Geometry AG17, Atlanta
Professional Honors and Awards
  • US Junior Oberwolfach Fellow, 2015.
  • Travel grant from Institute of Mathematics and its Applications (IMA), 2015.
  • NSF-funded travel award for NSF CMMI Grantee Conference, 2012.
  • John Morris fellowship and Tennenbaum scholarship, Georgia Tech, 2007-09.
Selected Publications
  1. Error bounds for monomial convexification in polynomial optimization, with W. Adams, Y. Xu. [arXiv]
  2. Extended formulations for convex hulls of graphs of bilinear functions, with N. Boland, T. Kalinowski, F. Rigterink, H. Waterer. [arXiv]
  3. On Dantzig figures from lexicographic orders, with S. Poznanovic. [arXiv]
  4. Lexicographically optimal integer points: structural properties and complexity, with M. Eldredge*. [arXiv]
  5. Disjunctive inequalities for convexifying product terms in 0/1 nonconvex MINLPs, with S. Ahmed, S. Dey. [PDF]
  6. Branch-and-bound for biobjective mixed-integer programming, N. Adelgren*. [OptOnline]
  7. A mean-risk MINLP for transportation network protection, with Y. Huang, J. Lu*. [PDF]
  8. Efficient storage of Pareto points in biobjective MIPINFORMS Journal on Computing, minor revisions, with N. Adelgren*, P. Belotti. [arXiv].  
  9. Shorter version accepted to Proceedings of INFORMS Computing Society Meeting 2015, Richmond, Virginia, pp. 1 – 16. [PDF]
  10. Relaxations and discretizations for the pooling problemJournal of Global Optimization, 67 (3), pp. 631-669, 2017, with S. Ahmed, M. Cheon, S. Dey [Journal][Preprint]
  11. Convex hulls of superincreasing knapsacks and lexicographic orderings, Discrete Applied Mathematics, 201, pp. 150-163, 2016. [Journal] [Preprint]
  12. Analysis of MILP techniques for the pooling problem, Operations Research, 63 (2), pp. 412 – 427, 2015, with S. Dey. [Journal][Preprint]
  13. Pooling problems: an overview, accepted to Optimization and Analytics in the Oil and Gas Industry, eds. K. Furman, J. Song, International Series in Operations Research and Management Science, Springer, 2015, pp. 1 – 38, with S. Ahmed, M. Cheon, S. Dey. [PDF]
  14. Solving mixed integer bilinear problems using MILP formulations, SIAM Journal on Optimization, 23 (2), pp. 721 – 744, 2013, with S. Ahmed, M. Cheon, S. Dey. [Journal][Preprint]
  15. A multidisciplinary design optimization algorithm with distributed autonomous subsystems, Proceedings of 7th World Congress on Structural and Multidisciplinary Optimization, Seoul, Korea, pp. 481 – 491, 2007, with J. Desai, S. Missoum, S. Sen. [CD-only][PDF]

(*) graduate student

Recent Classes Taught

Math 812 : Discrete Optimization - Fall '13, '14, '15
Math 810 : Mathematical Optimization - Spring '15, '17
Math 440/640 : Linear Programming - Spring & Fall '14
Math 206 : Multivariate Calculus - Fall '15, Spring '16

Links
Last Updated: 4/13/17