Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear programming problem”

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 451 records · Page 25

Disjunctive optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems

This paper proposes a new optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems. The model optimizes both investment decisions (e.g., size, location, and time to install, retire and decommission facilities) and operation decisions (e.g., on/off status, operating capacity, and expected power output). It is also able to optimize reserve systems (or backup systems), as well as the main systems, to improve power systems reliability. An impact of operational strategies of generators (i.e., participating in electricity production vs. remaining as idle units during operation) on power systems reliability is considered. Probability of equipment failures and capacity failure states are used to rigorously estimate the power systems reliability depending on design and operation strategies. The optimization model is formulated with Generalized Disjunctive Programming (GDP), which is reformulated as a mixed-integer linear programming (MILP) model using the Hull relaxation. Two reliability-related penalties, such as downtime penalty and unmet demand penalty, are included in the objective function to maximize reliability while minimizing the total net present cost. Furthermore, a bilevel decomposition with tailored cuts is developed to reduce computational times of the multi-scale optimization model. The effectiveness of the proposed model is shown by comparing the results with the results obtained from the expansion planning models that do not explicitly consider reliability. In conclusion, we also show that the proposed bilevel decomposition is computationally efficient for solving large scale problems through 5-years and 10-years planning case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

pvplr-python: Python package implementation of PVplr for Performance Loss Rate (PLR) analysis

Due to software fragmentation, PV system modeling teams can be limited to language specific packages, preventing cross-sectional analysis of different modeling techniques and workflows. To this end, PVplr, a popular PV performance modeling R software package, has been ported to the Python programming language. To verify and test the robustness of the port, NSRDB data has been used to simulated PV installations at native resolution (~2 million Sites), with a variety of degradation rates, degradation patterns, and modules. Performance Ratios were calculated using the ported functions from pvplr-python and compared against Rdtools YoY values. Due to the complicated nature of degradation, a new metric has been proposed to quantify the performance loss of a system. The cumulative production loss, is the total amount of energy lost due to the degrading performance of the system. Cumulative production loss alleviates the problems with fitting linear functions to non-linear degradation. Cumulative Production loss was shown to better estimate the total lost revenue for non-linear degradation patterns. $XbX + UTC$ was found to most accurately predict the total lost revenue in simulated systems.

Kumar, Suraj↗

Treatment Planning System Calculation Errors Are Present in Most Imaging and Radiation Oncology Core-Houston Phantom Failures

Purpose: The anthropomorphic phantom program at the Houston branch of the Imaging and Radiation Oncology Core (IROC-Houston) is an end-to-end test that can be used to determine whether an institution can accurately model, calculate, and deliver an intensity modulated radiation therapy dose distribution. Currently, institutions that do not meet IROC-Houston's criteria have no specific information with which to identify and correct problems. In the present study, an independent recalculation system was developed to identify treatment planning system (TPS) calculation errors. Methods and Materials: A recalculation system was commissioned and customized using IROC-Houston measurement reference dosimetry data for common linear accelerator classes. Using this system, 259 head and neck phantom irradiations were recalculated. Both the recalculation and the institution's TPS calculation were compared with the delivered dose that was measured. In cases in which the recalculation was statistically more accurate by 2% on average or 3% at a single measurement location than was the institution's TPS, the irradiation was flagged as having a “considerable” institutional calculation error. The error rates were also examined according to the linear accelerator vendor and delivery technique. Results: Surprisingly, on average, the reference recalculation system had better accuracy than the institution's TPS. Considerable TPS errors were found in 17% (n=45) of the head and neck irradiations. Also, 68% (n=13) of the irradiations that failed to meet the IROC-Houston criteria were found to have calculation errors. Conclusions: Nearly 1 in 5 institutions were found to have TPS errors in their intensity modulated radiation therapy calculations, highlighting the need for careful beam modeling and calculation in the TPS. An independent recalculation system can help identify the presence of TPS errors and pass on the knowledge to the institution.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Overvoltage Prevention and Curtailment Reduction Using Adaptive Droop-Based Supplementary Control in Smart Inverters

Recent developments in the renewable energy sector have seen an unprecedented growth in residential photovoltaic (PV) installations. However, high PV penetration levels often lead to overvoltage problems in low-voltage (LV) distribution feeders. Smart inverter control such as active power curtailment (APC)-based overvoltage control can be implemented to overcome these challenges. The APC technique utilizes a constant droop-based approach which curtails power rigidly, which can lead to significant energy curtailment in the LV distribution feeders. In this paper, different variations of the APC technique with linear, quadratic, and exponential droops have been analyzed from the point-of-view of energy curtailment for a LV distribution network in North America. Further, a combinatorial approach using various droop-based APC methods in conjunction with adaptive dynamic programming (ADP) as a supplementary control scheme has also been proposed. The proposed approach minimizes energy curtailment in the LV distribution network by adjusting the droop gains. Simulation results depict that ADP in conjunction with exponential droop reduces the energy curtailment to approximately 50% compared to using the standard linear droop.

42 ENGINEERING↗

Extending quantum operations

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A communication-avoiding 3D sparse triangular solver

We present a novel distributed memory algorithm to improve the strong scalability of the solution of a sparse triangular system. This operation appears in the solve phase of direct methods for solving general sparse linear systems, Ax = b. Our 3D sparse triangular solver employs several techniques, including a 3D MPI process grid, elimination tree parallelism, and data replication, all of which reduce the per-process communication when combined. We present analytical models to understand the communication cost of our algorithm and show that our 3D sparse triangular solver can reduce the per-process communication volume asymptotically by a factor of O(n1/4) and O(n1/6) for problems arising from the finite element discretizations of 2D "planar" and 3D "non-planar" PDEs, respectively. We implement our algorithm for use in SuperLU_DIST3D, using a hybrid MPI+OpenMP programming model. Our 3D triangular solve algorithm, when run on 12k cores of Cray XC30, outperforms the current state-of-the-art 2D algorithm by 7.2x for planar and 2.7x for the non-planar sparse matrices, respectively.

Sao, Piyush↗

Balancing Power Absorption Against Structural Loads With Viscous Drag and Power-Takeoff Efficiency Considerations

The focus of this paper is to balance power absorption against structural loading for a novel fixed-bottom oscillating surge wave energy converter in both regular and irregular wave environments. The power-to-load ratio will be evaluated using pseudospectral control (PSC) to determine the optimum power-takeoff (PTO) torque based on a multiterm objective function. This paper extends the pseudospectral optimal control problem to not just maximize the time-averaged absorbed power but also include measures for the surge-foundation force and PTO torque in the optimization. The objective function may now potentially include three competing terms that the optimizer must balance. Separate weighting factors are attached to the surge-foundation force and PTO control torque that can be used to tune the optimizer performance to emphasize either power absorption or load shedding. To correct the pitch equation of motion, derived from linear hydrodynamic theory, a quadratic-viscous-drag torque has been included in the system dynamics; however, to continue the use of quadratic programming solvers, an iteratively obtained linearized drag coefficient was utilized that provided good accuracy in the predicted pitch motion. Furthermore, the analysis considers the use of a nonideal PTO unit to more accurately evaluate controller performance. The PTO efficiency is not directly included in the objective function but rather the weighting factors are utilized to limit the PTO torque amplitudes, thereby reducing the losses resulting from the bidirectional energy flow through a nonideal PTO. Furthermore, results from PSC show that shedding a portion of the available wave energy can lead to greater reductions in structural loads, peak-to-average power ratio, and reactive power requirement.

16 TIDAL AND WAVE POWER↗

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗

On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks

Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In the multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime.

Lin, Yunyue↗

High Performance Computing Modeling Advances Accelerator Science for High-Energy Physics

The development and optimization of particle accelerators are essential for advancing our understanding of the properties of matter, energy, space, and time. Particle accelerators are complex devices whose behavior involves many physical effects on multiple scales. Therefore, advanced computational tools utilizing high-performance computing are essential for accurately modeling them. In the past decade, the US Department of Energy's SciDAC program has produced accelerator-modeling tools that have been employed to tackle some of the most difficult accelerator science problems. The authors discuss the Synergia framework and its applications to high-intensity particle accelerator physics. Synergia is an accelerator simulation package capable of handling the entire spectrum of beam dynamics simulations. Our authors present Synergia's design principles and its performance on HPC platforms.

43 PARTICLE ACCELERATORS↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

RF Breakdown in Magnetic Fields: Previous Work, Recent Theory, and Future Plans

Recent experiments on the breakdown of rf cavities revealed severe surface damage and a reduction of the maximum accelerating gradient after operation in an external magnetic field. This finding implies the possibility of serious problems for cooling lattices wherein rf cavities and external magnetic fields coexist, such as those of the proposed neutrino factory and muon collider. An experimental program that could study those problems and their possible solutions is discussed. Emphasis is given to a magnetically insulated cavity design in which the walls are parallel to the magnetic field lines and consequently damage from field emission is expected to be suppressed.

43 PARTICLE ACCELERATORS↗

TOUGHREACT User's Guide: A Simulation Program for Non-isothermal Multiphase Reactive Geochemical Transport in Variably Saturated Geologic Media, V1.2.1

Coupled modeling of subsurface multiphase fluid and heat flow, solute transport, and chemical reactions can be applied to many geologic systems and environmental problems, including geothermal systems, diagenetic and weathering processes, subsurface waste disposal, acid mine drainage remediation, contaminant transport, and groundwater quality. TOUGHREACT has been developed as a comprehensive non-isothermal multi-component reactive fluid flow and geochemical transport simulator to investigate these and other problems. A number of subsurface thermo-physical-chemical processes are considered under various thermohydrological and geochemical conditions of pressure, temperature, water saturation, and ionic strength. TOUGHREACT can be applied to one-, two- or three-dimensional porous and fractured media with physical and chemical heterogeneity. The code can accommodate any number of chemical species present in liquid, gas and solid phases. A variety of equilibrium chemical reactions are considered, such as aqueous complexation, gas dissolution/exsolution, and cation exchange. Mineral dissolution/precipitation can take place subject to either local equilibrium or kinetic controls, with coupling to changes in porosity and permeability and capillary pressure in unsaturated systems. Chemical components can also be treated by linear adsorption and radioactive decay. The first version of the non-isothermal reactive geochemical transport code TOUGHREACT was developed (Xu and Pruess, 1998) by introducing reactive geochemistry into the framework of the existing multi-phase fluid and heat flow code TOUGH2 (Pruess, 1991). TOUGHREACT was further enhanced with the addition of (1) treatment of mineral-water-gas reactive-transport under boiling conditions, (2) an improved HKF activity model for aqueous species, (3) gas species diffusion coefficients calculated as a function of pressure, temperature, and molecular properties, (4) mineral reactive surface area formulations for fractured and porous media, and (5) porosity, permeability, and capillary pressure changes owing to mineral precipitation/dissolution (Sonnenthal et al., 1998, 2000, 2001; Spycher et al., 2003a). Subsequently, TOUGH2 V2 was released with additional EOS modules and features (Pruess et al., 1999). The present version of TOUGHREACT includes all of the previous extensions to the original version, along with the replacement of the original TOUGH2 (Pruess, 1991) by TOUGH2 V2 (Pruess et al., 1999). TOUGHREACT has been applied to a wide variety of problems, some of which are included as examples, such as: (1) Supergene copper enrichment (Xu et al., 2001); (2) Mineral alteration in hydrothermal systems (Xu and Pruess, 2001a; Xu et al., 2004b; Dobson et al., 2004); (3) Mineral trapping for CO{sub 2} disposal in deep saline aquifers (Xu et al., 2003b and 2004a); (4) Coupled thermal, hydrological, and chemical processes in boiling unsaturated tuff for the proposed nuclear waste emplacement site at Yucca Mountain, Nevada (Sonnenthal et al., 1998, 2001; Sonnenthal and Spycher, 2000; Spycher et al., 2003a, b; Xu et al., 2001); (5) Modeling of mineral precipitation/dissolution in plug-flow and fracture-flow experiments under boiling conditions (Dobson et al., 2003); (6) Calcite precipitation in the vadose zone as a function of net infiltration (Xu et al., 2003); and (7) Stable isotope fractionation in unsaturated zone pore water and vapor (Singleton et al., 2004). The TOUGHREACT program makes use of 'self-documenting' features. It is distributed with a number of input data files for sample problems. Besides providing benchmarks for proper code installation, these can serve as a self-teaching tutorial in the use of TOUGHREACT, and they provide templates to help jump-start new applications. The fluid and heat flow part of TOUGHREACT is derived from TOUGH2 V2, so in addition to the current manual, users must have the manual of the TOUGH2 V2 (Pruess et al., 1999). The present version of TOUGHREACT provides the following TOUGH2 fluid property or 'EOS' (equation-of-state) modules: (1) EOS1 for water, or two waters with typical applications to hydrothermal problems, (2) EOS2 for multiphase mixtures of water and CO{sub 2} also with typical applications to hydrothermal problems, (3) EOS3 for multiphase mixtures of water and air with typical applications to vadose zone and nuclear waste disposal problems, (4) EOS4 that has the same capabilities as EOS3 but with vapor pressure lowering effects due to capillary pressure, (5) EOS9 for single phase water (Richards equation) with typical applications to ambient temperature and pressure reactive geochemical transport problems, and (6) ECO2N for multiphase mixtures of water, CO{sub 2} and NaCl with typical applications to CO{sub 2} disposal in deep brine aquifers.

54 ENVIRONMENTAL SCIENCES↗

Coordination of Wind Farm and Pumped-Storage Hydro for a Self-Healing Power Grid

The increasing penetration of wind energy poses great challenges to the operation of power systems in normal and emergency states. However, energy storage technologies can help accommodate wind power uncertainty and variability due to their flexible characteristics. This paper focuses on the restoration phase, and provides a novel coordination strategy of wind and pumped-storage hydro (PSH) units for a faster and reliable self-healing process. The wind-PSH assisted power system restoration is formulated as a two-stage adaptive robust optimization problem. The first-stage problem determines the start-up sequence of generators and the energization times of transmission paths; and the second-stage problem decides load pickup sequences, wind power dispatch levels, and PSH units' operating modes. The column-and-constraint generation decomposition algorithm is applied to solve the two-stage adaptive robust optimization problem, which has a mixed-integer optimization in the inner-level problem. The developed coordination strategy is tested on the modified IEEE 39-bus system. Numerical results demonstrate that the coordinated wind and PSH units can increase the total energy served, enhance wind power dispatchability, and reduce wind power curtailment.

17 WIND ENERGY↗

A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems

This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.

97 MATHEMATICS AND COMPUTING↗

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal

Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses [log 2 n] queries for a list of length n. Quantum computers can achieve a constant-factor speedup, but the best possible coefficient of log 2 n for exact quantum algorithms is only known to lie between (ln2)/π ≈ 0.221 and 4/log 2 605 ≈ 0.4333. We consider a special class of translation-invariant algorithms with no workspace, introduced by Farhi, Goldstone, Gutmann, and Sipser, that has been used to find the best known upper bounds. First, we show that any bounded-error, k-query quantum algorithm for ordered search can be implemented by a k-query algorithm in this special class. Second, we use linear programming to show that the best exact 5-query quantum algorithm can search a list of length 7265, giving an ordered search algorithm that asymptotically uses 5 log 7265 n ≈ 0.390 log 2 n quantum queries.

Translation-invariant quantum algorithms↗