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
Mixed Integer Linear & Nonlinear Optimization, Polyhedral Combinatorics
Other Professional Activities
Upcoming Events: 
  • INFORMS Annual Meeting 2017, Houston
  • Simons Institute Workshop on Hierarchies, Extended Formulations, and Matrix Analytic Techniques, Berkeley
  • Dagstuhl Seminar on Mixed-Integer Nonlinear Optimization, Schloss Dagstuhl, Germany
  • INFORMS Optimization Society Meeting 2018, Denver
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. Extended formulations for convex hulls of graphs of bilinear functions, with N. Boland, T. Kalinowski, F. Rigterink, H. Waterer. [arXiv]
  2. On Dantzig figures from lexicographic orders, with S. Poznanović. [arXiv]
  3. Lexicographically optimal integer points: structural properties and complexity, with M. Eldredge*. [arXiv]
  4. Polymatroid inequalities for convexifying product terms in 0/1 nonconvex MINLP, with S. Ahmed, S. Dey. [PDF]
  5. Branch-and-bound for biobjective mixed-integer programming, with N. Adelgren*. [OptOnline]
  6. Error bounds for monomial convexification in polynomial optimization, Math. Program. Series Aminor revisions, with W. Adams, Y. Xu*. [arXiv]
  7. A mean-risk MINLP for transportation network protection, Eur. J. Oper. Res., in press, 2017, with Y. Huang, J. Lu*. [Journal][Preprint]
    • Preliminary version [PDF] accepted to Proceedings of Transportation Research Board (TRB) 94th Annual Meeting 2015, 18 pp.
  8. Efficient storage of Pareto points in biobjective mixed-integer programmingINFORMS J. Comput., minor revisions, with N. Adelgren*, P. Belotti. [arXiv].  
    • Preliminary version [PDF] accepted to Proceedings of INFORMS Computing Society Meeting 2015, 16 pp.
  9. Relaxations and discretizations for the pooling problemJ. Global Optim., 67 (3), pp. 631 – 669, 2017, with S. Ahmed, M. Cheon, S. Dey [Journal][Preprint]
  10. Convex hulls of superincreasing knapsacks and lexicographic orderings, Discrete Appl. Math., 201, pp. 150 – 163, 2016. [Journal] [Preprint]
  11. Analysis of MILP techniques for the pooling problem, Oper. Res., 63 (2), pp. 412 – 427, 2015, with S. Dey. [Journal][Preprint]
  12. Pooling problems: an overview, accepted to Optimization and Analytics in the Oil and Gas Industry, eds. K. Furman, J. Song, International Series in ORMS, Springer, 2015, pp. 1 – 38, with S. Ahmed, M. Cheon, S. Dey. [PDF]
  13. Solving mixed integer bilinear problems using MILP formulations, SIAM J. Optim., 23 (2), pp. 721 – 744, 2013, with S. Ahmed, M. Cheon, S. Dey. [Journal][Preprint]
  14. 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, '17, Spring '16

Links
Last Updated: 8/17/17