skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on June 29, 2026

Title: Sample-Based Piecewise Linear Power Flow Approximations Using Second-Order Sensitivities
The inherent nonlinearity of the power flow equations poses significant challenges in accurately modeling power systems, particularly when employing linearized approximations. Although power flow linearizations provide computational efficiency, they can fail to fully capture nonlinear behavior across diverse operating conditions. To improve approximation accuracy, we propose conservative piecewise linear approximations (CPLA) of the power flow equations, which are designed to consistently over- or under-estimate the quantity of interest, ensuring conservative behavior in optimization. The flexibility provided by piecewise linear functions can yield improved accuracy relative to standard linear approximations. However, applying CPLA across all dimensions of the power flow equations could introduce significant computational complexity, especially for large-scale optimization problems. In this paper, we propose a strategy that selectively targets dimensions exhibiting significant nonlinearities. Using a second-order sensitivity analysis, we identify the directions where the power flow equations exhibit the most significant curvature and tailor the CPLAs to improve accuracy in these specific directions. This approach reduces the computational burden while maintaining high accuracy, making it particularly well-suited for mixed-integer programming problems involving the power flow equations.  more » « less
Award ID(s):
2145564
PAR ID:
10649623
Author(s) / Creator(s):
 ;  ;  
Publisher / Repository:
IEEE
Date Published:
Page Range / eLocation ID:
1 to 7
Subject(s) / Keyword(s):
Conservative piecewise linear approximation Second-order sensitivities Power flow approximation
Format(s):
Medium: X
Location:
Kiel, Germany
Sponsoring Org:
National Science Foundation
More Like this
  1. The power flow equations are central to many problems in power system planning, analysis, and control. However, their inherent non-linearity and non-convexity present substantial challenges during problem-solving processes, especially for optimization problems. Accordingly, linear approximations are commonly employed to streamline computations, although this can often entail compromises in accuracy and feasibility. This paper proposes an approach termed Conservative Bias Linear Approximations (CBLA) for addressing these limitations. By minimizing approximation errors across a specified operating range while incorporating conservativeness (over- or under-estimating quantities of interest), CBLA strikes a balance between accuracy and tractability by maintaining linear constraints. By allowing users to design loss functions tailored to the specific approximated function, the bias approximation approach significantly enhances approximation accuracy. We illustrate the effectiveness of our proposed approach through several test cases. 
    more » « less
  2. Combinatorial distribution system optimization problems, such as scheduling electric vehicle (EV) charging during evacuations, present significant computational challenges. These challenges stem from the large numbers of constraints, continuous variables, and discrete variables, coupled with the unbalanced nature of distribution systems. In response to the escalating frequency of extreme events impacting electric power systems, this paper introduces a method that integrates sample-based conservative linear power flow approximations (CLAs) into an optimization framework. In particular, this integration aims to ameliorate the aforementioned challenges of distribution system optimization in the context of efficiently minimizing the charging time required for EVs in urban evacuation scenarios. 
    more » « less
  3. The Optimal Power Shutoff (OPS) problem is an optimization problem that makes power line de-energization decisions in order to reduce the risk of igniting a wildfire, while minimizing the load shed of customers. This problem, with DC linear power flow equations, has been used in many studies in recent years. However, using linear approximations for power flow when making decisions on the network topology is known to cause challenges with AC feasibility of the resulting network, as studied in the related contexts of optimal transmission switching or grid restoration planning. This paper explores the accuracy of the DC OPS formulation and the ability to recover an AC-feasible power flow solution after de-energization decisions are made. We also extend the OPS problem to include variants with the AC, Second-Order-Cone, and Network-Flow power flow equations, and compare them to the DC approximation with respect to solution quality and time. The results highlight that the DC approximation overestimates the amount of load that can be served, leading to poor de-energization decisions. The AC and SOC-based formulations are better, but prohibitively slow to solve for even modestly sized networks thus demonstrating the need for new solution methods with better trade-offs between computational time and solution quality. 
    more » « less
  4. Throughout the past decades, many different versions of the widely used first-order Cell-Transmission Model (CTM) have been proposed for optimal traffic control. Highway traffic management techniques such as Ramp Metering (RM) are typically designed based on an optimization problem with nonlinear constraints originating in the flow-density relation of the Fundamental Diagram (FD). Most of the extended CTM versions are based on the trapezoidal approximation of the flow-density relation of the Fundamental Diagram (FD) in an attempt to simplify the optimization problem. However, this relation is naturally nonlinear, and crude approximations can greatly impact the efficiency of the optimization solution. In this study, we propose a class of extended CTMs that are based on piecewise affine approximations of the flow-density relation such that (a) the integrated squared error with respect to the true relation is greatly reduced in comparison to the trapezoidal approximation, and (b) the optimization problem remains tractable for real-time application of ramp metering optimal controllers. A two-step identification method is used to approximate the FD with piecewise affine functions resulting in what we refer to as PWA-CTMs. The proposed models are evaluated by the performance of the optimal ramp metering controllers, e.g. using the widely used PI-ALINEA approach, in complex highway traffic networks. Simulation results show that the optimization problems based on the PWA-CTMs require less computation time compared to other CTM extensions while achieving higher accuracy of the flow and density evolution. Hence, the proposed PWA-CTMs constitute one of the best approximation approaches for first-order traffic flow models that can be used in more general and challenging modeling and control applications. 
    more » « less
  5. We present a novel machine learning (ML) method to accelerate conservative-to-primitive inversion, focusing on hybrid piecewise polytropic and tabulated equations of state. Traditional root-finding techniques are computationally expensive, particularly for large-scale relativistic hydrodynamics simulations. To address this, we employ feedforward neural networks (NNC2PS and NNC2PL), trained in PyTorch and optimized for GPU inference using NVIDIA TensorRT, achieving significant speedups with minimal accuracy loss. The NNC2PS model achieves L1 and L∞ errors of 4.54×10−7 and 3.44×10−6, respectively, while the NNC2PL model exhibits even lower error values. TensorRT optimization with mixed-precision deployment substantially accelerates performance compared to traditional root-finding methods. Specifically, the mixed-precision TensorRT engine for NNC2PS achieves inference speeds approximately 400 times faster than a traditional single-threaded CPU implementation for a dataset size of 1,000,000 points. Ideal parallelization across an entire compute node in the Delta supercomputer (Dual AMD 64 core 2.45 GHz Milan processors; and 8 NVIDIA A100 GPUs with 40 GB HBM2 RAM and NVLink) predicts a 25-fold speedup for TensorRT over an optimally-parallelized numerical method when processing 8 million data points. Moreover, the ML method exhibits sub-linear scaling with increasing dataset sizes. We release the scientific software developed, enabling further validation and extension of our findings. This work underscores the potential of ML, combined with GPU optimization and model quantization, to accelerate conservative-to-primitive inversion in relativistic hydrodynamics simulations. 
    more » « less