Jul 2009 to May 2013
Bachelor of Technology (Honors)
Department of Civil Engineering,
Indian Institute of Technology, Kharagpur.
Thesis: Extremes of non-stationary stochastic load sequences
Aug 2015 - Oct 2018
PhD., Department of Civil Engineering,
Johns Hopkins University, Baltimore, MD.
Jan 2019 - Till date
Department of Mathematics and Industrial Engineering,
Polytechnique Montreal, Montreal, QC.
May 2012 - Jul 2012
Intern, Equity Quant,
Jun 2013 - Feb 2015
Analyst, Structured Credit Trading,
Feb 2015 - May 2015
Senior Analyst, Structured Credit Trading,
Jan 2016 - May 2016
EN.560.442 Equilibrium Modeling in Systems Engineering
Responsibilities: Setting assignment questions, grading assignments and exams
EN.500.111.13 Decomposing the World: Engineering and Modeling Complex Systems
Hopkins Engineering Applications and Research Tutorials
Jan 2017 - May 2017
EN.560.442 Equilibrium Modeling in Systems Engineering
Responsibilities: Setting assignment questions, grading assignments and exams, Lecturing
 (Working Paper) A bargaining model for the Chilean waitlist management in public hospitals. (With Jorge Acuna Melo, Felipe Feijoo, Diego Martinez, Jose Zayas-Castro)
 (Working Paper) A bilevel model to locate electric vehicle charging stations with power grid integration. (With Vignesh Subramanian, Felipe Feijoo, Kevin Melendez)
 (Under Review) A learning-based algorithm to quickly compute good primal solutions for two-stage stochastic integer programs. (With Yoshua Bengio, Emma Frejinger, Andrea Lodi and Rahul Patel) - arXiv
Abstract: We propose a novel approach using supervised learning to obtain near-optimal primal solutions for two-stage stochastic integer programming (2SIP) problems with constraints in the first and second stages. The goal of the algorithm is to predict a representative scenario (RS) for the problem such that, deterministically solving the 2SIP with the random realization equal to the RS, gives a near-optimal solution to the original 2SIP. Predicting an RS, instead of directly predicting a solution ensures first-stage feasibility of the solution. If the problem is known to have complete recourse, second-stage feasibility is also guaranteed. For computational testing, we learn to find an RS for a two-stage stochastic facility location problem with integer variables and linear constraints in both stages and consistently provide near-optimal solutions. Our computing times are very competitive with those of general-purpose integer programming solvers to achieve a similar solution quality.
 (Under review) When Nash meets Stackelberg. (WIth Margarida Carvalho, Gabriele Dragotto, Felipe Feijoo, Andrea Lodi). Code available - Preprint: arXiv.
Abstract: We analyze Nash games played among leaders of Stackelberg games (NASP), and prove it is Sigma-2-p-hard to decide if the game has a mixed-strategy Nash equilibrium (MNE). We then provide a finite algorithm which computes exact MNEs for NASP when there is at least one, or returns a certificate if no MNE exists. We introduce an inner approximation hierarchy that increasingly grows the description of each Stackelberg leader feasible region. Furthermore, we extend the algorithmic framework to specifically retrieve a pure-strategy Nash Equilibrium if one exists - and present a combinatorial algorithm for this latter task. Finally, we provide computational tests on a range of NASPs instances inspired by international energy trades.
 What are the domestic and regional impacts from Ethiopia's policy on the export ban of teff? In Frontiers in Sustainable Food Systems (With Ying Zhang, Jess Carnie, Yalemzewd Nigussie, Befikadu Amphune, Belay Birhanu, Benjamin Zaitchik and Sauleh Siddiqui)
Abstract: In response to global food price volatility and trends towards increased global food demand, Ethiopian policy makers were forced to adopt strategies such as restricting food exports in order to protect domestic food security. However, these policies can have a disproportionate regional impact on domestic markets and can result in lost revenue from exports. For this reason, they have been criticized as inefficient from the perspective of economic development. Here, we examine the sub-national dynamics of a ban on food exports. We do this for the case of Ethiopia’s ban on exports of teff, a staple grain in the country that has increasing global demand. We assess the impact of the ban and of proposed policies to relax the ban, across regions within the country and for various market actors along the teff value chain. Using a partial-equilibrium model developed with a detailed modeling of the agro-economic features of the country, we analyze the direct impacts on export revenue, producers’ profits, transport patterns, and consumption across the disaggregated regions in Ethiopia due to changes to its teff export policy. In particular, we show that the immediate benefit due to significant increase in international revenue due to large teff export would be enjoyed primarily by food distributors and storage operators while the crop producers’ profits increase only negligibly. Simulations also indicate that lifting the export ban would be expected to have significant impacts on domestic transportation of teff between regions (for example from Mekelle to Werder), and to reduce consumption of teff significantly in some regions (for example, Semera, Jijiga), an effect due to the lack of competition in the transportation sector. The granularity of the model helps us capture the possibility of such lopsided benefits which were not captured in earlier studies.
 Mixed-integer bilevel representability. In Mathematical Programming - Series A (With Amitabh Basu and Christopher Ryan). [pdf]
Abstract: We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints (with no integer variables), complementarity constraints, and polyhedral reverse convex constraints are all finite unions of polyhedra. Conversely, any finite union of polyhedra can be represented using any one of these three paradigms. We then prove that the feasible region of bilevel problems with integer constraints exclusively in the upper level is a finite union of sets representable by mixed-integer programs and vice versa. Further, we prove that, up to topological closures, we do not get additional modeling power by allowing integer variables in the lower level as well. To establish the last statement, we prove that the family of sets that are finite unions of mixed-integer representable sets forms an algebra of sets (up to topological closures).
 Can cut generating functions be good and efficient? In SIAM Journal on Optimization. (With Amitabh Basu). [pdf]
Abstract: Making cut generating functions (CGFs) computationally viable is a central question in modern integer programming research. One would like to find CGFs that are simultaneously good, i.e., there are good guarantees for the cutting planes they generate, and efficient, meaning that the values of the CGFs can be computed cheaply (with procedures that have some hope of being implemented in current solvers). We investigate in this paper to what extent this balance can be struck. We propose a family of CGFs which, in a sense, achieves this harmony between good and efficient. In particular, we provide a parameterized family of $b+\Z^n$ free sets to derive CGFs from and show that our proposed CGFs give a good approximation of the closure given by CGFs obtained from all maximal $b+\Z^n$ free sets and their so-called trivial liftings, and simultaneously, show that these CGFs can be computed with explicit, efficient procedures. We provide a constructive framework to identify these sets as well as computing their trivial lifting. We follow it up with computational experiments to demonstrate this and to evaluate their practical use. Our proposed family of cuts seem to give some tangible improvement on randomly generated instances compared to GMI cuts; however, in MIPLIB 3.0 instances, and vertex cover and stable problems on random graph instances, their performance is poor.
 The future of natural fas infrastructure development in the United States. In Applied Energy. (With Felipe Feijoo, Charalampos Avraam, Gokul Iyer, Marshall Wise, Leon Clarke, Matthew Binstead, Pralit Patel, Natalia Prates, Evelyn Torres-Alfaro and Sauleh Siddiqui). [pdf]
Abstract: Changes in the natural gas market have spawned the need for pipeline infrastructure planning. Previous studies have analyzed natural gas infrastructure development largely independent of the interactions of the natural gas sector with the broader economy. However, natural gas infrastructure development is strongly influenced by broader domestic and international socioeconomic conditions. We couple a global Human-Earth system model with state-level detail in the United States (GCAM-USA) that provides the broader socioeconomic context for natural gas supply and demand with a natural gas infrastructure investment model (NANGAM) to examine interstate natural gas pipeline infrastructure development in the U.S. under a range of socioeconomic scenarios. Here we show that existing pipeline infrastructure in the U.S. is insufficient to satisfy the increasing demand for natural gas and investments in pipeline capacity will be required. However, the geographic distribution of investments within the U.S. is heterogeneous and depends on the capacity of existing infrastructure as well as the magnitude of increase in demand. Our results also illustrate the risks of under-utilization of pipeline capacity, in particular, under a scenario characterized by long-term systemic transitions toward a low-carbon economy. More broadly, our study highlights the value of integrated approaches to facilitate informed decision-making.
 Sensitivity and covariance in a large scale stochastic complementarity problem for Natural Gas Markets, In European Journal of Operational Research. (With Felipe Feijoo and Sauleh Siddiqui). [pdf]
Abstract: We provide an efficient method to approximate the covariance between decision variables and uncertain parameters in solutions to a general class of stochastic nonlinear complementarity problems. We also develop a sensitivity metric to quantify uncertainty propagation by determining the change in the variance of the output due to a change in the variance of an input parameter. The covariance matrix of the solution variables quantifies the uncertainty in the output and pairs correlated variables and parameters. The sensitivity metric helps in identifying the parameters that cause maximum fluctuations in the output. The method developed in this paper optimizes the use of gradients and matrix multiplications which makes it particularly useful for large-scale problems. Having developed this method, we extend the deterministic version of the North American Natural Gas Model (NANGAM), to incorporate effects due to uncertainty in the parameters of the demand function, supply function, infrastructure costs, and investment costs. We then use the sensitivity metrics to identify the parameters that impact the equilibrium the most.
Conferences and Talks
STEM Achievement in Baltimore Elementary Schools (SABES) is an NSF-funded collaboration between Baltimore City Public Schools and Johns Hopkins University to improve educational outcomes in STEM disciplines throughout Baltimore City’s elementary schools with a targeted focus on community engagement in three neighborhoods.