Professor Suyog Nigudkar earned his PhD in Production and Quantitative Methods from the Indian Institute of Management, Ahmedabad. He has done his BTech in Production and Industrial Engineering from Maulana Azad National Institute of Technology, Bhopal. His professional experience includes working as a Process Coach at Ford India Pvt. Ltd.

His research interests include multi-level optimization, interdiction problems, robust optimisation, resilient network design, and humanitarian operations. His doctoral thesis is on developing exact solution methods for linear and non-linear multi-level optimization problems. He has presented his work at various national and international conferences like Euro 2021 (Athens), Euro Working Group on Location Analysis (EWGLA-XXV, 2019)- Brussels, and the 52nd Annual Convention of Operations Research Society of India (ORSI) & International Conference (2019).
 

• Suyog Nigudkar, Ankur Sinha and Sachin Jayaswal. “An exact solution method for non-linear max-min programs: An application to facility interdiction problem with congestion”
  This paper proposes an exact algorithm for solving non-linear mixed-integer max-min problems with linear constraints and a convex objective function. The max-min structure induces non-convexity in the optimisation problem, which may lead to multiple local optima. The facility interdiction problem under congestion is an example of a non-linear mixed-integer max-min program that is hard to solve. We solve large scale instances of the application problem with different types of non-linear congestion terms using the proposed technique. (Reject and Resubmit at Management Science. Resubmitted to Management Science. Under review.)
• Suyog Nigudkar, Sachin Jayaswal, and Ankur Sinha. “Design for failure of food banking networks”.
  In this article, we propose a tri-level formulation to design a food banking network by considering the possibility of disruptions at the design stage. We propose exact solution methods to solve the inner bi-level and the tri-level problems. Subsequently, we perform a detailed study on the location planning for the Feeding America food banking network of the US and the Indian Food Banking Network (IFBN). (Manuscript under preparation for Production and Operations Management (POMS) Journal)
• Suyog Nigudkar, Ankur Sinha and Sachin Jayaswal. “An exact method for a class of nonlinear bilevel knapsack problem”
  This paper proposes an exact approach to solve concave min-max or convex max-min problems having discrete lower-level variables. We use the proposed approach to solve two application problems (Concave Knapsack Interdiction Problem and Quadratic Capacitated Facility Interdiction Problem), which have not been solved in the literature. (Manuscript under preparation. To be submitted to Operations Research Journal)