Optimal power flow in distribution networks under N- 1 disruptions: a multistage stochastic programming approach
DOI10.1287/IJOC.2021.1080zbMATH Open1492.90065OpenAlexW3213348062MaRDI QIDQ5085985FDOQ5085985
Authors: Haoxiang Yang, Harsha Nagarajan 
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1080
Recommendations
- Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption
- Generation and storage dispatch in electricity networks with generator disruptions
- scientific article; zbMATH DE number 124611
- Publication:3489789
- Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty
distribution networkoptimal power flowmultistage stochastic programstochastic disruption\(N - 1\) contingency
Convex programming (90C25) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)
Cites Work
- JuMP: a modeling language for mathematical optimization
- SDDP.jl: A Julia Package for Stochastic Dual Dynamic Programming
- On the convergence of stochastic dual dynamic programming and related methods
- A multicut algorithm for two-stage stochastic linear programs
- Multi-stage stochastic optimization applied to energy planning
- On the convergence of sampling-based decomposition algorithms for multistage stochastic programs
- Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Lectures on Stochastic Programming
- Analysis of stochastic dual dynamic programming method
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- On the convergence of decomposition methods for multistage stochastic convex programs
- Sequential importance sampling algorithms for dynamic stochastic programming
- Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
- Robust Optimization for Electricity Generation
- Exact Convex Relaxation of Optimal Power Flow in Radial Networks
- Electrical transmission system cascades and vulnerability. An operations research viewpoint
- Communication-Constrained Expansion Planning for Resilient Distribution Systems
Cited In (4)
- Optimal mitigation and control over power system dynamics for stochastic grid resilience
- Generation and storage dispatch in electricity networks with generator disruptions
- Optimization of stochastic lossy transport networks and applications to power grids
- Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption
Uses Software
This page was built for publication: Optimal power flow in distribution networks under \(N- 1\) disruptions: a multistage stochastic programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085985)
