Modeling Abstractions and Automatic Discretization Frameworks for Optimization Problems with Differential Equations in Pyomo.
Abstract not provided.
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.
Explore the source record for details and available documents.
Optimal power flow (OPF) is an important problem in the operation of electric power systems. The solution to an OPF problem provides a minimum cost operating point that satisfies constraints imposed by both the non-linear power flow equations and engineering limits. These constraints can yield non-convex feasible spaces that result in significant computational challenges. This brief proposes an algorithm that identifies and characterizes non-convexities in OPF feasible spaces. This algorithm searches for a pair of feasible points whose connecting line segment contains an infeasible point. Such points certify the existence of a non-convexity in the OPF feasible space. Moreover, the constraint violations at the infeasible point along the connecting line segment physically characterize a cause of the non-convexity. Numerical demonstrations include a small illustrative example as well as applications to various test cases.
Equivalence of optimal control problems and transformation of optimal control problems with compact control regions into Lagrange problems