Search NASA⌕ Search

SEARCH · Search NASA

Results for “LINEAR PROGRAMMING”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

SIERRA Multimechanics Module: Aria Thermal Theory Manual (Version 4.46)

This document describes the theoretical foundation of thermal analysis in Sierra Mechanics. The SIERRA Multimechanics Module: Aria, henceforth referred to as Aria for brevity, was developed at Sandia National Laboratories under the ASC program, and approximates linear and nonlinear continuum models of heat transfer. Aria uses the SIERRA Framework, which provides data management services commonly required by computational mechanics software, and facilitates the development of coupled, multi-mechanics applications for massively parallel computers. The mathematical models in Aria are based heavily on those of COYOTE, a well-established thermal analysis program that was also developed at Sandia and its ASC code predecessor, Calore. Aria, Calore and COYOTE share a significant body of numerical methods, which are described in detail by Reddy and Gartling. Throughout this document, the terms software and implementation are synonymous with the Aria thermal-fluid analysis computer program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

SIERRA Multimechanics Module: Aria Thermal Theory Manual (Version 4.44)

This document describes the theoretical foundation of thermal analysis in Sierra Mechanics. The SIERRA Multimechanics Module: Aria, henceforth referred to as Aria for brevity, was developed at Sandia National Laboratories under the ASC program, and approximates linear and nonlinear continuum models of heat transfer. Aria uses the SIERRA Framework, which provides data management services commonly required by computational mechanics software, and facilitates the development of coupled, multi-mechanics applications for massively parallel computers. The mathematical models in Aria are based heavily on those of COYOTE, a well-established thermal analysis program that was also developed at Sandia and its ASC code predecessor, Calore. Aria, Calore and COYOTE share a significant body of numerical methods, which are described in detail by Reddy and Gartling. Throughout this document, the terms software and implementation are synonymous with the Aria thermal-fluid analysis computer program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

SIERRA Multimechanics Module: Aria Thermal Theory Manual (Version 4.42)

This document describes the theoretical foundation of thermal analysis in Sierra Mechanics. The SIERRA Multimechanics Module: Aria, henceforth referred to as Aria for brevity, was developed at Sandia National Laboratories under the ASC program, and approximates linear and nonlinear continuum models of heat transfer. Aria uses the SIERRA Framework, which provides data management services commonly required by computational mechanics software, and facilitates the development of coupled, multi-mechanics applications for massively parallel computers. The mathematical models in Aria are based heavily on those of COYOTE, a well-established thermal analysis program that was also developed at Sandia and its ASC code predecessor, Calore. Aria, Calore and COYOTE share a significant body of numerical methods, which are described in detail by Reddy and Gartling. Throughout this document, the terms software and implementation are synonymous with the Aria thermal-fluid analysis computer program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A Bi-Level Formulation And Solution Method For The Integration Of Process Design And Scheduling

Design and operation decisions of manufacturing plants can often be expressed within a hierarchical structure, where optimal decisions at lower operating level provide constraints for the decision raking at a higher decision level. In this work, we are addressing the case of a hierarchical design and scheduling optimization problem. The integration of design and scheduling decisions can play a big role in designing economically profitable plants and improving their operational performance. This problem can be expressed as a bi-level problem, where design related decisions occur at the upper level and operational scheduling decisions at the lower level. Since discrete decisions are involved in both optimization levels, the resulting formulation typically corresponds to bi-level mixed-integer programming problems (B-MIP). The solution of B-MIP problems is very challenging, and typically requires the use of global optimization techniques, with many algorithms not able to guarantee feasibility. To overcome the challenges in solving this class of problems we propose the use of a multi-parametric based algorithm for the solution of bi-level mixed-integer linear and quadratic programming problems, capable of providing the exact and global solution. The main idea of this approach is to treat the lower scheduling problem as a multi-parametric programming problem in which the design decisions are considered as parameters. Here, the resulting parametric solutions can then be substituted into the upper level design problem, which can be solved as a set of single-level deterministic programming problems. Through the developed formulation and algorithm we are able to supply the decision makers with the exact solution of the integrated design and scheduling problem.

42 ENGINEERING↗
DOE OSTI2018

Probabilistic N - k failure-identification for power systems

This work considers a probabilistic generalization of the N - k failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the N - k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances; the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

First evaluation of meson and τ lepton spectra and search for heavy neutral leptons at ILC beam dump

A beam dump experiment can be seamlessly added to the proposed Inter- national Linear Collider (ILC) program because the high energy electron beam should be dumped after the collision point. The ILC beam dump experiment will provide an excellent opportunity to search for new long-lived particles. Since many of them can be produced by a rare decay of standard model particles, we evaluate spectra of the mesons and τ lepton at the decay based on the PHITS and PYTHIA8 simulations. As a motivated physics case, we study the projected sensitivity of heavy neutral leptons at the ILC beam dump experiment. The heavy neutral leptons can also be produced via deep inelastic scattering and Z boson decay at the ILC main detector, which we include in the projection. With the multi-track signal, the reach would be greatly extended in mass and coupling, even compared with the other proposed searches.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

A robust offering strategy for wind producers considering uncertainties of demand response and wind power

This paper proposes a risk-constrained decision-making approach for a wind power producer participating in the day-ahead market. In the developed model, a flexible demand response trading scheme between the wind power producer and different customers is employed. Through the proposed demand response mechanism, the wind power producer is able to trade demand response resource internally with different customers, and then trade energy externally with the market to increase the expected profit and the wind energy utilization. The uncertainties in the wind power and demand response are modeled by using the information gap decision theory approach from risk averse (robust) and risk-seeking (opportunistic) perspectives. The objective of the robust model is to maximize the robust level while satisfying the desired profit, whereas the opportunistic model aims to evaluate the possibility of achieving windfall profits with favorable uncertainties. The overall offering strategy problem is modeled as a bi-objective mixed integer nonlinear programming, which is linearized by proper techniques and solved efficiently by using the normal boundary intersection technique. In this work, simulation results show that utilizing demand response resource to mitigate wind power deviations can increase a wind power producer's profit and reduce potential risks. In addition, the results demonstrate that the proposed bi-objective optimization approach enables the wind power producer to select appropriate offering decisions with respect to uncertainties.

17 WIND ENERGY↗
DOE OSTI2015

Next-generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience

This report summarizes the work performed under the project project Next-Generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for infrastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years of Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasible region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality constraints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

SU-F-T-169: A Periodic Quality Assurance Program for a Spot-Scanning Proton Treatment Facility

Purpose: To develop daily and monthly quality assurance (QA) programs in support of a new spot-scanning proton treatment facility using a combination of commercial and custom equipment and software. Emphasis was placed on efficiency and evaluation of key quality parameters. Methods: The daily QA program was developed to test output, spot size and position, proton beam energy, and image guidance using the Sun Nuclear Corporation rf-DQA™3 device and Atlas QA software. The program utilizes standard Atlas linear accelerator tests repurposed for proton measurements and a custom jig for indexing the device to the treatment couch. The monthly QA program was designed to test mechanical performance, image quality, radiation quality, isocenter coincidence, and safety features. Many of these tests are similar to linear accelerator QA counterparts, but many require customized test design and equipment. Coincidence of imaging, laser marker, mechanical, and radiation isocenters, for instance, is verified using a custom film-based device devised and manufactured at our facility. Proton spot size and position as a function of energy are verified using a custom spot pattern incident on film and analysis software developed in-house. More details concerning the equipment and software developed for monthly QA are included in the supporting document. Thresholds for daily and monthly tests were established via perturbation analysis, early experience, and/or proton system specifications and associated acceptance test results. Results: The periodic QA program described here has been in effect for approximately 9 months and has proven efficient and sensitive to sub-clinical variations in treatment delivery characteristics. Conclusion: Tools and professional guidelines for periodic proton system QA are not as well developed as their photon and electron counterparts. The program described here efficiently evaluates key quality parameters and, while specific to the needs of our facility, could be readily adapted to other proton centers.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

KSpaceNavigator (KSN)

Intuitive GUI for manipulating microscope stages, allowing to align crystallographic data with stages, allowing to align crystallographic data with stage coordinates and microscope images. Simulates kinematic diffraction patterns and Kikuchi line patterns. Simulated patterns can be displayed as overlay to actually measured data, allowing manual fingerprinting and angular alignment. Crystallographic data is fed to the program in form of CIF (crystallographic information file) files, which are available from many databases and cover virtually all crystal structure ever reported in any journal. Actual goniometer scales can be linearized by lookup tables, program can be used with any microscope goniometer, double tilt and tilt-rotation type. Software requirements: Win32 platform (XP); Compiler/Version: Borland C++ Builder 5; Type of files: Executable modules; Hardware requirement: PC

Duden, Thomas↗
DOE OSTI2015

Heterogenous Acceleration for Linear Algebra in Multi-coprocessor Environments

We present an efficient and scalable programming model for the development of linear algebra in heterogeneous multi-coprocessor environments. The model incorporates some of the current best design and implementation practices for the heterogeneous acceleration of dense linear algebra (DLA). Examples are given as the basis for solving linear systems' algorithms - the LU, QR, and Cholesky factorizations. To generate the extreme level of parallelism needed for the efficient use of coprocessors, algorithms of interest are redesigned and then split into well-chosen computational tasks. The tasks execution is scheduled over the computational components of a hybrid system of multi-core CPUs and coprocessors using a light-weight runtime system. The use of lightweight runtime systems keeps scheduling overhead low, while enabling the expression of parallelism through otherwise sequential code. This simplifies the development efforts and allows the exploration of the unique strengths of the various hardware components.

Luszczek, Piotr R↗
DOE OSTI2024

A taxonomy of automatic differentiation pitfalls

Automatic differentiation is a popular technique for computing derivatives of computer programs. While automatic differentiation has been successfully used in countless engineering, science, and machine learning applications, it can sometimes nevertheless produce surprising results. In this paper, we categorize problematic usages of automatic differentiation, and illustrate each category with examples such as chaos, time-averages, discretizations, fixed-point loops, lookup tables, linear solvers, and probabilistic programs, in the hope that readers may more easily avoid or detect such pitfalls. We also review debugging techniques and their effectiveness in these situations.

Autodiff↗
DOE OSTI2015

SU-F-BRB-16: A Spreadsheet Based Automatic Trajectory GEnerator (SAGE): An Open Source Tool for Automatic Creation of TrueBeam Developer Mode Robotic Trajectories

Purpose: To automate creation and delivery of robotic linac trajectories with TrueBeam Developer Mode, an open source spreadsheet-based trajectory generation tool has been developed, tested and made freely available. The computing power inherent in a spreadsheet environment plus additional functions programmed into the tool insulate users from the underlying schema tedium and allow easy calculation, parameterization, graphical visualization, validation and finally automatic generation of Developer Mode XML scripts which are directly loadable on a TrueBeam linac. Methods: The robotic control system platform that allows total coordination of potentially all linac moving axes with beam (continuous, step-and-shoot, or combination thereof) becomes available in TrueBeam Developer Mode. Many complex trajectories are either geometric or can be described in analytical form, making the computational power, graphing and programmability available in a spreadsheet environment an easy and ideal vehicle for automatic trajectory generation. The spreadsheet environment allows also for parameterization of trajectories thus enabling the creation of entire families of trajectories using only a few variables. Standard spreadsheet functionality has been extended for powerful movie-like dynamic graphic visualization of the gantry, table, MLC, room, lasers, 3D observer placement and beam centerline all as a function of MU or time, for analysis of the motions before requiring actual linac time. Results: We used the tool to generate and deliver extended SAD “virtual isocenter” trajectories of various shapes such as parameterized circles and ellipses. We also demonstrated use of the tool in generating linac couch motions that simulate respiratory motion using analytical parameterized functions. Conclusion: The SAGE tool is a valuable resource to experiment with families of complex geometric trajectories for a TrueBeam Linac. It makes Developer Mode more accessible as a vehicle to quickly translate research ideas into machine readable scripts without programming knowledge. As an open source initiative, it also enables researcher collaboration on future developments. I am a full time employee at Varian Medical Systems, Palo Alto, California.

43 PARTICLE ACCELERATORS↗
DOE OSTI2016

Preliminary Conceptual Design Report for the FACET-II Project at SLAC National Accelerator Laboratory

Plasma wakefield acceleration has the potential to dramatically shrink the size and cost of particle accelerators. Research at the SLAC National Accelerator Laboratory has demonstrated that plasmas can provide 1,000 times the acceleration in a given distance compared with current technologies. Developing revolutionary and more efficient acceleration techniques that allow for an affordable high-energy collider is the focus of FACET, a National User Facility at SLAC. The existing FACET National User Facility uses part of SLAC’s two-mile-long linear accelerator to generate high-density beams of electrons and positrons. FACET-II is a new test facility to develop advanced acceleration and coherent radiation techniques with high-energy electron and positron beams. It is the only facility in the world with high energy positron beams. FACET-II provides a major upgrade over current FACET capabilities and the breadth of the potential research program makes it truly unique. It will synergistically pursue accelerator science that is vital to the future of both advanced acceleration techniques for High Energy Physics, ultra-high brightness beams for Basic Energy Science, and novel radiation sources for a wide variety of applications. The design parameters for FACET-II are set by the requirements of the plasma wakefield experimental program. To drive the plasma wakefield requires a high peak current, in excess of 10kA. To reach this peak current, the electron and positron design bunch size is 10μ by 10μ transversely with a bunch length of 10μ. This is more than 200 times better than what has been achieved at the existing FACET. The beam energy is 10 GeV, set by the Linac length available and the repetition rate is up to 30 Hz. The FACET-II project is scheduled to be constructed in three major stages. Components of the project discussed in detail include the following: electron injector, bunch compressors and linac, the positron system, the Sector 20 sailboat and W chicanes, and experimental area and infrastructure.

43 PARTICLE ACCELERATORS↗
DOE OSTI2015

Non-Constant Learning Rates in Retrospective Experience Curve Analyses and their Correlation to Deployment Programs

A key challenge for policy-makers and technology market forecasters is to estimate future technology costs and in particular the rate of cost reduction versus production volume. A related, critical question is what role should state and federal governments have in advancing energy efficient and renewable energy technologies? This work provides retrospective experience curves and learning rates for several energy-related technologies, each of which have a known history of federal and state deployment programs. We derive learning rates for eight technologies including energy efficient lighting technologies, stationary fuel cell systems, and residential solar photovoltaics, and provide an overview and timeline of historical deployment programs such as state and federal standards and state and national incentive programs for each technology. Piecewise linear regimes are observed in a range of technology experience curves, and public investments or deployment programs are found to be strongly correlated to an increase in learning rate across multiple technologies. A downward bend in the experience curve is found in 5 out of the 8 energy-related technologies presented here (electronic ballasts, magnetic ballasts, compact fluorescent lighting, general service fluorescent lighting, and the installed cost of solar PV). In each of the five downward-bending experience curves, we believe that an increase in the learning rate can be linked to deployment programs to some degree. This work sheds light on the endogenous versus exogenous contributions to technological innovation and highlights the impact of exogenous government sponsored deployment programs. This work can inform future policy investment direction and can shed light on market transformation and technology learning behavior.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Hyperplane decision trees as piecewise linear surrogate models for chemical process design

Recent trends in chemical engineering research point towards an increasing reliance on data-driven modeling approaches. Neural networks, for instance, have proven to be accurate when data is plentiful and high-dimensional, but in many cases, they require computationally-intensive training procedures. Here, in this work, we describe hyperplane decision trees (HT) as a highly expressive and low-compute machine learning model architecture. These models are locally linear and have linear decision boundaries, resulting in a piecewise linear model of the data. This property allows them to be converted into mixed-integer linear constraints which can be globally optimized. Our open-source PyTorch implementation of this method is a fast, flexible, and accessible way to build accurate piecewise linear models of data.

Decision trees↗