Francisco Jara-Moroni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Francisco Jara-Moroni has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Andreas Wächter
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208 USA
2 shared publications - Carlos Muñoz-Rey1 shared publication
- Gonzalo A. Ruz
Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Santiago, Chile
1 shared publication - John E. Mitchell
Math. Sci., Rensselaer Polytechnic Institute
1 shared publication Jong-Shi Pang
University of Southern California
1 shared publication- Jong-Shi Pang
The Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, USA
1 shared publication
Latest Publications
- Open Access
- 8 October 2026
- Published by Elsevier in SSRN Electronic Journal
A Data-Driven Multistage Stochastic Programming Approach to Energy Storage Management in Residential Microgrids
The integration of Distributed Energy Resources (DERs) into the grid introduces significant stochasticity, requiring robust real-time management strategies at the grid edge. This paper presents GEMA, an integrated framework for the optimal dispatch of residential storage that bridges data-driven forecasting with computationally efficient multistage stochastic optimization. We utilize Long Short-Term Memory (LSTM) neural networks with Monte Carlo dropout to generate probabilistic scenarios for demand and solar generation, capturing the time-varying uncertainty inherent to renewable prosumers. Unlike standard approaches that rely on simplified heuristics or computationally expensive mixed-integer programming, our model employs Stochastic Dual Dynamic Programming (SDDP). This enables rigorous handling of stochastic scenarios at 30-minute resolution while maintaining the computational speed required for rolling-horizon deployment. Uniquely, GEMA is not limited to simulation; it is experimentally validated on a fully operational, grid-connected microgrid in central-southern Chile. Results demonstrate that GEMA outperforms price-based control in every month of the simulated year, and that on the deployed microgrid it delivers a consistent daily profit advantage while closely tracking a perfect-information benchmark, thereby unlocking the economic flexibility of residential storage. The proposed framework provides a scalable, hardware-validated pipeline to transform passive residential connections into active, optimized grid nodes.
- 8 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Data-Driven Multistage Stochastic Programming Approach to Energy Storage Management in Residential Microgrids
The integration of Distributed Energy Resources (DERs) into the grid introduces significant stochasticity, requiring robust real-time management strategies at the grid edge. This paper presents GEMA, an integrated framework for the optimal dispatch of residential storage that bridges data-driven forecasting with computationally efficient multistage stochastic optimization. We utilize Long Short-Term Memory (LSTM) neural networks with Monte Carlo dropout to generate probabilistic scenarios for demand and solar generation, capturing the time-varying uncertainty inherent to renewable prosumers. Unlike standard approaches that rely on simplified heuristics or computationally expensive mixed-integer programming, our model employs Stochastic Dual Dynamic Programming (SDDP). This enables rigorous handling of stochastic scenarios at 30-minute resolution while maintaining the computational speed required for rolling-horizon deployment. Uniquely, GEMA is not limited to simulation; it is experimentally validated on a fully operational, grid-connected microgrid in central-southern Chile. Results demonstrate that GEMA outperforms price-based control in every month of the simulated year, and that on the deployed microgrid it delivers a consistent daily profit advantage while closely tracking a perfect-information benchmark, thereby unlocking the economic flexibility of residential storage. The proposed framework provides a scalable, hardware-validated pipeline to transform passive residential connections into active, optimized grid nodes.
- Open Access
- 17 July 2026
- Published by Elsevier in SSRN Electronic Journal
Adaptive Scenario Partitioning for Stochastic Bilevel Linear Programs
This paper develops an adaptive scenario partitioning approach for stochastic bilevel linear programs. The method extends the Adaptive Partitioning Method, originally designed for two-stage stochastic programs, to settings in which a leader makes a first-stage decision while anticipating scenario-dependent optimal responses from a follower. The proposed approach solves a sequence of aggregated master problems and refines scenario groups using information from the follower’s optimal bases and primal–dual signatures. We also study computational variants based on basis-aware refinement, scenario bundling, and non-trivial initial partitions obtained from K-means clustering and central initialization. The approach is evaluated on stochastic continuous bilevel knapsack instances with up to 3,200 scenarios and compared with an extended reference formulation. The results show that basisawarerefinement and informative initial partitions substantially reduce solution times while keepingobjective gaps small relative to the reference model. These findings indicate that adaptive partitioning is a promising computational strategy for large-scale stochastic bilevel optimization.
- 17 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAdaptive Scenario Partitioning for Stochastic Bilevel Linear Programs
This paper develops an adaptive scenario partitioning approach for stochastic bilevel linear programs. The method extends the Adaptive Partitioning Method, originally designed for two-stage stochastic programs, to settings in which a leader makes a first-stage decision while anticipating scenario-dependent optimal responses from a follower. The proposed approach solves a sequence of aggregated master problems and refines scenario groups using information from the follower’s optimal bases and primal–dual signatures. We also study computational variants based on basis-aware refinement, scenario bundling, and non-trivial initial partitions obtained from K-means clustering and central initialization. The approach is evaluated on stochastic continuous bilevel knapsack instances with up to 3,200 scenarios and compared with an extended reference formulation. The results show that basisawarerefinement and informative initial partitions substantially reduce solution times while keepingobjective gaps small relative to the reference model. These findings indicate that adaptive partitioning is a promising computational strategy for large-scale stochastic bilevel optimization.
- 8 May 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 77 (4) , 687-714
An enhanced logical benders approach for linear programs with complementarity constraints
- 8 May 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 77 (4) , 687-714
An enhanced logical benders approach for linear programs with complementarity constraints
- 14 November 2017
- Published by Springer Nature in Mathematical Programming
- Vol. 169 (1) , 221-254
A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- 14 November 2017
- Published by Springer Nature in Mathematical Programming
- Vol. 169 (1) , 221-254
A study of the difference-of-convex approach for solving linear programs with complementarity constraints