Large Scale Optimal Power Flow Based on Interior Point Quadratic Programming of Solving Symmetric Indefinite System

1995 ◽  
Vol 28 (10) ◽  
pp. 377-382
Author(s):  
Hua Wei ◽  
Hiroshi Sasaki
2021 ◽  
Author(s):  
Sayed Abdullah Sadat ◽  
mostafa Sahraei-Ardakani

After decades of research, efficient computation of AC Optimal Power Flow (ACOPF) still remains a challenge. ACOPF is a nonlinear nonconvex problem, and operators would need to solve ACOPF for large networks in almost real-time. Sequential Quadratic Programming (SQP) is one of the powerful second-order methods for solving large-scale nonlinear optimization problems and is a suitable approach for solving ACOPF with large-scale real-world transmission networks. However, SQP, in its general form, is still unable to solve large-scale problems within industry time limits. This paper presents a customized Sequential Quadratic Programming (CSQP) algorithm, taking advantage of physical properties of the ACOPF problem and the choice of the best performing ACOPF formulation. The numerical experiments suggest that CSQP outperforms commercial and noncommercial nonlinear solvers and solves test cases within the industry time limits. A wide range of test cases, ranging from 500-bus systems to 30,000-bus systems, are used to verify the test results.


2021 ◽  
Author(s):  
Sayed Abdullah Sadat ◽  
mostafa Sahraei-Ardakani

After decades of research, efficient computation of AC Optimal Power Flow (ACOPF) still remains a challenge. ACOPF is a nonlinear nonconvex problem, and operators would need to solve ACOPF for large networks in almost real-time. Sequential Quadratic Programming (SQP) is one of the powerful second-order methods for solving large-scale nonlinear optimization problems and is a suitable approach for solving ACOPF with large-scale real-world transmission networks. However, SQP, in its general form, is still unable to solve large-scale problems within industry time limits. This paper presents a customized Sequential Quadratic Programming (CSQP) algorithm, taking advantage of physical properties of the ACOPF problem and the choice of the best performing ACOPF formulation. The numerical experiments suggest that CSQP outperforms commercial and noncommercial nonlinear solvers and solves test cases within the industry time limits. A wide range of test cases, ranging from 500-bus systems to 30,000-bus systems, are used to verify the test results.


2000 ◽  
Vol 15 (4) ◽  
pp. 1457-1458
Author(s):  
M. Madrigal ◽  
V.H. Quintana ◽  
H. Wei ◽  
H. Sasaki ◽  
J. Kubokawa ◽  
...  

2020 ◽  
Vol 34 (01) ◽  
pp. 630-637 ◽  
Author(s):  
Ferdinando Fioretto ◽  
Terrence W.K. Mak ◽  
Pascal Van Hentenryck

The Optimal Power Flow (OPF) problem is a fundamental building block for the optimization of electrical power systems. It is nonlinear and nonconvex and computes the generator setpoints for power and voltage, given a set of load demands. It is often solved repeatedly under various conditions, either in real-time or in large-scale studies. This need is further exacerbated by the increasing stochasticity of power systems due to renewable energy sources in front and behind the meter. To address these challenges, this paper presents a deep learning approach to the OPF. The learning model exploits the information available in the similar states of the system (which is commonly available in practical applications), as well as a dual Lagrangian method to satisfy the physical and engineering constraints present in the OPF. The proposed model is evaluated on a large collection of realistic medium-sized power systems. The experimental results show that its predictions are highly accurate with average errors as low as 0.2%. Additionally, the proposed approach is shown to improve the accuracy of the widely adopted linear DC approximation by at least two orders of magnitude.


Sign in / Sign up

Export Citation Format

Share Document