Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical optimization”

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.

At least 919 records · Page 51

Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems

This paper focuses on a time-varying constrained nonconvex optimization problem, and considers the synthesis and analysis of online regularized primal-dual gradient methods to track a Karush-Kuhn-Tucker (KKT) trajectory. The proposed regularized primal-dual gradient method is implemented in a running fashion, in the sense that the underlying optimization problem changes during the execution of the algorithms. In order to study its performance, we first derive its continuous-time limit as a system of differential inclusions. We then study sufficient conditions for tracking a KKT trajectory, and also derive asymptotic bounds for the tracking error (as a function of the time-variability of a KKT trajectory). Further, we provide a set of sufficient conditions for the KKT trajectories not to bifurcate or merge, and also investigate the optimal choice of the parameters of the algorithm. Illustrative numerical results for a time-varying nonconvex problem are provided.

differential inclusion↗

Calibration of ITER Instant Power Neutron Monitors: Recommended Scenario of Experiments at the Reactor

Instant power is a key parameter of the ITER. Its monitoring with an accuracy of a few percent is an urgent and challenging aspect of neutron diagnostics. In a series of works published in Problems of Atomic Science and Technology, Series: Thermonuclear Fusion under a common title, the step-by-step neutronics analysis was given to substantiate a calibration technique for the DT and DD modes of the ITER. A Gauss quadrature scheme, optimal for processing “expensive” experiments, is used for numerical integration of {sup 235}U and {sup 238}U detector responses to the point sources of 14-MeV neutrons. This approach allows controlling the integration accuracy in relation to the number of coordinate mesh points and thus minimizing the number of irradiations at the given uncertainty of the full monitor response. In the previous works, responses of the divertor and blanket monitors to the isotropic point sources of DT and DD neutrons in the plasma profile and to the models of real sources were calculated within the ITER model using the MCNP code. The neutronics analyses have allowed formulating the basic principles of calibration that are optimal for having the maximum accuracy at the minimum duration of in situ experiments at the reactor. In this work, scenarios of the preliminary and basic experimental ITER runs are suggested on the basis of those principles. It is proposed to calibrate the monitors only with DT neutrons and use correction factors to the DT mode calibration for the DD mode. It is reasonable to perform full calibration only with {sup 235}U chambers and calibrate {sup 238}U chambers by responses of the {sup 235}U chambers during reactor operation (cross-calibration). The divertor monitor can be calibrated using both direct measurement of responses at the Gauss positions of a point source and simplified techniques based on the concepts of equivalent ring sources and inverse response distributions, which will considerably reduce the amount of measurements. It is shown that the monitor based on the average responses of the horizontal and vertical neutron chambers remains spatially stable as the source moves and can be used in addition to the staff monitor at neutron fluxes in the detectors four orders of magnitude lower than on the first wall, where staff detectors are located. Owing to low background, detectors of neutron chambers do not need calibration in the reactor because it is actually determination of the absolute detector efficiency for 14-MeV neutrons, which is a routine out-of-reactor procedure.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Research and Development of a Low Cost Solar Collector

This is a Final Technical Report on the Research and Development completed towards the development of a Low Cost Solar Collector conducted under the DOE cost-sharing award EE-0003591. The objective of this project was to develop a new class of solar concentrators with geometries and manufacturability that could significantly reduce the fully installed cost of the solar collector field for concentrated solar thermal power plants. The goal of the project was to achieve an aggressive cost target of $\$$170/m 2 , a reduction of up to 50% in the total installed cost of a solar collector field as measured against the current industry benchmark of a conventional parabolic trough. The project plan, and the detailed activities conducted under the scope of the DOE Award project addressed all major drivers that affect solar collector costs. In addition to costs, the study also focused on evaluating technical performance of new collector architectures and compared them to the performance of the industry benchmark parabolic trough. The most notable accomplishment of this DOE award was the delivery of a full-scale integrated design, manufacturing and field installation solution for a new class of solar collector architecture which has been classified as the Bi-Planar Fresnel Collector (BPFC) and may be considered as a viable alternative to the conventional parabolic trough, as well as the conventional Fresnel collectors. This was in part accomplished through the design and development, all the way through fabrication and test validation of a new class of Linear Planar Fresnel Collector architecture. This architecture offers a number of key differentiating features which include a planar light-weight frame geometry with small mass-manufacturable elements utilizing flat mirror sections. The designs shows significant promise in reducing the material costs, fabrication costs, shipping costs, and on-site field installation costs compared to the benchmark parabolic trough, as well as the conventional Fresnel collector. The noteworthy design features of the BPFC architecture include the use of relatively cheaper flat mirrors and a design which allows the mirror support beam sections to act as load-bearing structural elements resulting in more than a 36% reduction in the overall structural weight compared to an optimized parabolic trough. Also, it was shown that the utilization of small mass-produced elements significantly lowers mass-production and logistics costs that can more quickly deliver economies of scale, even for smaller installations while also reducing shipping and installation costs. Moreover, unlike the traditional Fresnel trough the BPFC architecture does not require complex articulating drive mechanisms but instead utilizes a standard parabolic trough hydraulic drive mechanism. In addition to the development of the Bi-Planar Fresnel Collector, an optimized conventional space-frame type parabolic trough was also designed, built, analyzed and field-tested during the first phase of this award. The design of the conventional space-frame parabolic collector was refined with extensive FEA and CFD analysis to reduce material costs and re-designed for simpler fabrication and more accurate lower-cost field assembly. This optimized parabolic trough represented an improvement over the state-of-the art of the traditional parabolic trough architecture and also served as a more rigorous and less subjective benchmark that was used for comparison of new candidate design architectures. The results of the expanded 1 st phase of the DOE award project showed that both the Optimized Parabolic Trough and the new Bi-Planar Fresnel Collector design concepts failed to meet the primary objectives for the project of achieving a 50% cost reduction from the industry reference total installed cost of $\$$350/m 2 . Results showed that the BPFC came in at projected total installed cost of $\$$237/m 2 representing a 32% savings compared to the industry benchmark conventional parabolic trough. And the cost reduction obtained by the Optimized Parabolic Trough compared to the industry benchmark reference was approximately 16.5% against the industry benchmark. The new BPFC design showed a weight savings of almost 36% compared to the optimized parabolic trough and a 50% reduction in field assembly labor and a 13% reduction in shipping volume. The BPFC design showed only a marginal improvement of 16% over the fully projected installed cost of the optimized parabolic trough benchmark developed as Concept One. During the course of the investigation numerous sensitivity analyses and other analytical studies were conducted to assess potential improvement opportunities, and further optimizations that could lead to cost reductions and performance improvements. Factors that could have a significant impact on high-volume costs were related to production and further improvements in design for manufacturability, automation, assembly jigs, and fixtures, and robotic welding etc. The wind modeling analysis showed that the Fresnel design concept did not reduce the wind load in a significant manner. The stress analysis showed that the design concept with almost a 36% lower weight than the parabolic trough and it was strong enough to withstand the expected wind loads and maintain targeting accuracy. The Initial on-sun optical testing showed that the Fresnel Trough was capable of concentrating sunlight effectively to the desired target and yielding an optical efficiency slightly lower than a parabolic trough.

14 SOLAR ENERGY↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

A Scalable Solution Framework for Stochastic Transmission and Generation Planning Problems. Draft

Current commercial software tools for transmission and generation investment planning have limited stochastic modeling capabilities. Because of this limitation, electric power utilities generally rely on scenario planning heuristics to identify potentially robust and cost effective investment plans for a broad range of system, economic, and policy conditions. Several research studies have shown that stochastic models perform significantly better than deterministic or heuristic approaches, in terms of overall costs. However, there is a lack of practical solution approaches to solve such models. In this paper we propose a scalable decomposition algorithm to solve stochastic transmission and generation planning problems, respectively considering discrete and continuous decision variables for transmission and generation investments. Given stochasticity restricted to loads and wind, solar, and hydro power output, we develop a simple scenario reduction framework based on a clustering algorithm, to yield a more tractable model. The resulting stochastic optimization model is decomposed on a scenario basis and solved using a variant of the Progressive Hedging (PH) algorithm. We perform numerical experiments using a 240-bus network representation of the Western Electricity Coordinating Council in the US. Although convergence of PH to an optimal solution is not guaranteed for mixed-integer linear optimization models, we find that it is possible to obtain solutions with acceptable optimality gaps for practical applications. Our numerical simulations are performed both on a commodity workstation and on a high-performance cluster. The results indicate that large-scale problems can be solved to a high degree of accuracy in at most two hours of wall clock time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Comparing Numerical Models of the TALOS Wave Energy Converter

In this study, we present the development of a numerical model of the TALOS Wave Energy Converter (WEC) in WEC-Sim and compare it with existing numerical in-house models from Lancaster and results from DNV's Sesam code. The objective of this work is to validate the performance of the TALOS WEC using WEC-Sim and compare the results with those obtained from other numerical models. The TALOS WEC is a promising technology for the generation of clean, renewable energy from ocean waves. The development of a reliable numerical model for the TALOS WEC is crucial for its design and optimization. To achieve this, we have implemented the TALOS WEC in WEC-Sim and compared the results to in-house models from Lancaster and to results from DNV's Sesam code. Our results show good agreement with the results from Lancaster and DNV, demonstrating the accuracy and reliability of the numerical model developed in WEC-Sim. This work advances the field of wave energy conversion by providing a verified numerical model of the TALOS WEC, which can be used for further optimization and design studies.

CFD↗

Data-driven learning of nonlocal models: from high-fidelity simulations to constitutive laws

We show that machine learning can improve the accuracy of simulations of stress waves in one-dimensional composite materials. We propose a data-driven technique to learn nonlocal constitutive laws for stress wave propagation models. The method is an optimization-based technique in which the nonlocal kernel function is approximated via Bernstein polynomials. The kernel, including both its functional form and parameters, is derived so that when used in a nonlocal solver, it generates solutions that closely match high-fidelity data. The optimal kernel therefore acts as a homogenized nonlocal continuum model that accurately reproduces wave motion in a smaller-scale, more detailed model that can include multiple materials. We apply this technique to wave propagation within a heterogeneous bar with a periodic microstructure. Several one-dimensional numerical tests illustrate the accuracy of our algorithm. The optimal kernel is demonstrated to reproduce high-fidelity data for a composite material in applications that are substantially different from the problems used as training data.

97 MATHEMATICS AND COMPUTING↗

Minimization of environment-induced decoherence in quantum subsystems and application to solid-state-based quantum gates

A general formulation of optimal control theory for open quantum systems (quantum subsystems) based on a superoperator method is presented. This approach is applied to a computation of optimized time-dependent fields for solid-state-based realizations of quantum gates. Decoherence is incorporated within the spin-boson model and treated within, essentially, the Bloch-Redfield formalism. Generating a 'decoherence-free subspace' for the superoperator dynamically, we identify optimal trajectories in the phase space of the dynamical system for one- and two-qubit subsystems. Numerical analysis shows that, for the ideal case where one has full control over the subsystem's Hamiltonian, any gate operation can be realized with arbitrary small loss of coherence due to dephasing and optimal solutions exist which are independent of both spectral density and the temperature of the environment. At the example of a Josephson charge quantum gate we study the more realistic situation where one has a restricted number of control fields which, while providing a universal gate, cannot completely eliminate dephasing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Precision Computations in Strongly Coupled Conformal Field Theories (Final Technical Report)

Conformal Field Theories (CFTs) are quantum field theories that are invariant under the conformal symmetry group (which includes translations and rotations, but also local rescalings of spacetime). They are building blocks of general quantum field theories, and appear in many areas of physics, including statistical physics, condensed matter physics, particle physics, and quantum gravity. Because of their extra symmetries, the mathematical structure of CFTs is tightly constrained, and this leads to the idea of the ``conformal bootstrap," which is to use these mathematical structures to constrain, and in some cases determine, CFT observables. A new numerical implementation of the conformal bootstrap idea appeared in 2008 with the work of Rattazzi, Rychkov, Tonni, and Vichi. Their observation was that certain bootstrap constraints (conformal symmetry and unitarity) could be combined to yield a convex optimization problem that constraints CFT data. By solving this convex optimization problem on a computer, one could obtain bounds on observables like critical exponents and operator product expansion (OPE) coefficients. Over the course of this award, the PI has improved numerical bootstrap techniques by optimizing known algorithms and finding new ones for performing the required convex optimization computations. The PI has applied these techniques to compute high-precision observables in several important strongly-coupled systems. The PI has also explored both analytical and numerical bootstrap methods for constraining the space of low energy effective field theories of quantum gravity, and developed new analytical techniques for CFT and QFT more broadly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multilevel Monte Carlo simulation of Coulomb collisions

We present a new, for plasma physics, highly efficient multilevel Monte Carlo numerical method for simulating Coulomb collisions. The method separates and optimally minimizes the finite-timestep and finite-sampling errors inherent in the Langevin representation of the Landau–Fokker–Planck equation. It does so by combining multiple solutions to the underlying equations with varying numbers of timesteps. For a desired level of accuracy ε, the computational cost of the method is O(ε{sup −2}) or O(ε{sup −2}(lnε){sup 2}), depending on the underlying discretization, Milstein or Euler–Maruyama respectively. This is to be contrasted with a cost of O(ε{sup −3}) for direct simulation Monte Carlo or binary collision methods. We successfully demonstrate the method with a classic beam diffusion test case in 2D, making use of the Lévy area approximation for the correlated Milstein cross terms, and generating a computational saving of a factor of 100 for ε=10{sup −5}. We discuss the importance of the method for problems in which collisions constitute the computational rate limiting step, and its limitations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

XFEL diffraction: Developing processing methods to optimize data quality

Serial crystallography, using either femtosecond X-ray pulses from free-electron laser sources or short synchrotron-radiation exposures, has the potential to reveal metalloprotein structural details while minimizing damage processes. However, deriving a self-consistent set of Bragg intensities from numerous still-crystal exposures remains a difficult problem, with optimal protocols likely to be quite different from those well established for rotation photography. Here several data processing issues unique to serial crystallography are examined. It is found that the limiting resolution differs for each shot, an effect that is likely to be due to both the sample heterogeneity and pulse-to-pulse variation in experimental conditions. Shots with lower resolution limits produce lower-quality models for predicting Bragg spot positions during the integration step. Also, still shots by their nature record only partial measurements of the Bragg intensity. An approximate model that corrects to the full-spot equivalent (with the simplifying assumption that the X-rays are monochromatic) brings the distribution of intensities closer to that expected from an ideal crystal, and improves the sharpness of anomalous difference Fourier peaks indicating metal positions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A simulation‐based integrated virtual testbed for dynamic optimization in smart manufacturing systems

Abstract In a manufacturing system, production control‐related decision‐making activities occur at different levels. At the process level, one of the main control activities is to tune the parameters of individual manufacturing equipment. At the system level, the main activity is to coordinate production resources and to route parts to appropriate workstations based on their processing requirement, priority indices, and control policy. At the factory level, the goal is to plan and schedule the processing of parts at different operations for the entire system in order to optimize certain objectives. Note that the results of such activities at different levels are closely coupled and affect the overall performance of the manufacturing system as a whole. Therefore, it is important to systematically integrate these control and optimization activities into one unified platform to ensure the goal of each individual activity is aligned with the overall performance of the system. In this paper, we develop a simulation‐based virtual testbed that implements dynamic optimization, automatic information exchange, and decision‐making from the process‐level, system‐level, and factory‐level of a manufacturing system into an integrated computation environment. This is demonstrated by connecting a Python‐based numerical computation program, discrete‐event simulation software (Simul8), and an optimization solver (CPLEX) via a third‐party master program. The application of this simulation‐based virtual testbed is illustrated by a case study in a machining shop.

Sun, Yuting↗

Lasing in optimized two-dimensional iron-nail-shaped rod photonic crystals

We demonstrated lasing at the Γ-point band-edge (BE) modes in optimized two-dimensional iron-nail-shaped rod photonic crystals by optical pulse pumping at room temperature. As the radius of the rod increased quadratically toward the edge of the pattern, the quality factor of the Γ-point BE mode increased up to three times, and the modal volume decreased to 56% compared with the values of the original Γ-point BE mode because of the reduction of the optical loss in the horizontal direction. Single-mode lasing from an optimized iron-nail-shaped rod array with an InGaAsP multiple quantum well embedded in the nail heads was observed at a low threshold pump power of 160 μW. Real-image-based numerical simulations showed that the lasing actions originated from the optimized Γ-point BE mode and agreed well with the measurement results, including the lasing polarization, wavelength, and near-field image.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids

We present a new approach to efficiently solve optimization problems constrained by partial differential equations (PDEs) with uncertain coefficients. The method leverages two sources of inexactness that trade accuracy for speed: (1) stochastic collocation based on dimension-adaptive sparse grids (SGs), which approximates the stochastic objective function with a limited number of quadrature nodes, and (2) projection-based reduced-order models (ROMs), which generate efficient approximations to PDE solutions. These two sources of inexactness lead to inexact objective function and gradient evaluations, which are managed by a trust-region method that guarantees global convergence by adaptively refining the SG and ROM until a proposed error indicator drops below a tolerance specified by trust-region convergence theory. A key feature of the proposed method is that the error indicator---which accounts for errors incurred by both the SG and ROM---must be only an asymptotic error bound, i.e., a bound that holds up to an arbitrary constant that need not be computed. This allows the approach to be applicable to a wide range of problems, including those where sharp, computable error bounds are not available; this distinguishes the proposed method from previous works. Numerical experiments performed on a model problem from optimal flow control under uncertainty verify global convergence of the method and demonstrate the method's ability to outperform previously proposed alternatives.

97 MATHEMATICS AND COMPUTING↗

NONPARAMETRIC BAYESIAN ESTIMATION OF PERIODIC LIGHT CURVES

Many astronomical phenomena exhibit patterns that have periodic behavior. An important step when analyzing data from such processes is the problem of identifying the period: estimating the period of a periodic function based on noisy observations made at irregularly spaced time points. This problem is still a difficult challenge despite extensive study in different disciplines. This paper makes several contributions toward solving this problem. First, we present a nonparametric Bayesian model for period finding, based on Gaussian Processes (GPs), that does not make assumptions on the shape of the periodic function. As our experiments demonstrate, the new model leads to significantly better results in period estimation especially when the light curve does not exhibit sinusoidal shape. Second, we develop a new algorithm for parameter optimization for GP which is useful when the likelihood function is very sensitive to the parameters with numerous local minima, as in the case of period estimation. The algorithm combines gradient optimization with grid search and incorporates several mechanisms to overcome the high computational complexity of GP. Third, we develop a novel approach for using domain knowledge, in the form of a probabilistic generative model, and incorporate it into the period estimation algorithm. Experimental results validate our approach showing significant improvement over existing methods.

79 ASTRONOMY AND ASTROPHYSICS↗

Mapping the genome of meta-generalized gradient approximation density functionals: The search for B97M-V

A meta-generalized gradient approximation density functional paired with the VV10 nonlocal correlation functional is presented. The functional form is selected from more than 10{sup 10} choices carved out of a functional space of almost 10{sup 40} possibilities. Raw data come from training a vast number of candidate functional forms on a comprehensive training set of 1095 data points and testing the resulting fits on a comprehensive primary test set of 1153 data points. Functional forms are ranked based on their ability to reproduce the data in both the training and primary test sets with minimum empiricism, and filtered based on a set of physical constraints and an often-overlooked condition of satisfactory numerical precision with medium-sized integration grids. The resulting optimal functional form has 4 linear exchange parameters, 4 linear same-spin correlation parameters, and 4 linear opposite-spin correlation parameters, for a total of 12 fitted parameters. The final density functional, B97M-V, is further assessed on a secondary test set of 212 data points, applied to several large systems including the coronene dimer and water clusters, tested for the accurate prediction of intramolecular and intermolecular geometries, verified to have a readily attainable basis set limit, and checked for grid sensitivity. Compared to existing density functionals, B97M-V is remarkably accurate for non-bonded interactions and very satisfactory for thermochemical quantities such as atomization energies, but inherits the demonstrable limitations of existing local density functionals for barrier heights.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for physics informed scan path optimization in additive manufacturing

Site specific microstructure control is a critical research area within the field of additive manufacturing due to its potential to revolutionize part performance. One way to achieve site specific microstructure control is through control of the solidification conditions via the construction of intricate scan paths; however, the search space for such a problem is large. Previous attempts only considered the solidification conditions at the top surface while also requiring either lots of manual-fine tuning or large amounts of computational resources. This paper introduces a general method for scan path optimization which considers the solidification conditions in the bulk of the material without an increase in computational expense. This method consists of three core components:1. A heat transfer model for simulating the temperature field at a given time.2. A surrogate model which takes scan pattern information and temperature data and predicts the solidification conditions of the bulk as well as the meltpool depths for a spot melt.3. A decision algorithm to decide which spot melt should be printed next based on the outputs of the surrogate model.Each of these components can be changed without changing the overall method. Within this work, this method is applied in the creation of an algorithm containing a semi-analytic heat transfer model to simulate the temperature field, a fully convolutional neural network (FCNN) as the surrogate model, and a greedy decision algorithm. The resulting algorithm produced complex scan patterns which gave strong results for simulated microstructure control.

36 MATERIALS SCIENCE↗

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗