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 397 records · Page 22

Wing Leading Edge RCC Rapid Response Damage Prediction Tool (IMPACT2)

This rapid response computer program predicts Orbiter Wing Leading Edge (WLE) damage caused by ice or foam impact during a Space Shuttle launch (Program "IMPACT2"). The program was developed after the Columbia accident in order to assess quickly WLE damage due to ice, foam, or metal impact (if any) during a Shuttle launch. IMPACT2 simulates an impact event in a few minutes for foam impactors, and in seconds for ice and metal impactors. The damage criterion is derived from results obtained from one sophisticated commercial program, which requires hours to carry out simulations of the same impact events. The program was designed to run much faster than the commercial program with prediction of projectile threshold velocities within 10 to 15% of commercial-program values. The mathematical model involves coupling of Orbiter wing normal modes of vibration to nonlinear or linear springmass models. IMPACT2 solves nonlinear or linear impact problems using classical normal modes of vibration of a target, and nonlinear/ linear time-domain equations for the projectile. Impact loads and stresses developed in the target are computed as functions of time. This model is novel because of its speed of execution. A typical model of foam, or other projectile characterized by material nonlinearities, impacting an RCC panel is executed in minutes instead of hours needed by the commercial programs. Target damage due to impact can be assessed quickly, provided that target vibration modes and allowable stress are known.

Clark, Robert↗

TenSQL v.2023.01.20

SAND2024-02520O Tensor SQL Database performs certain relational database management system/structured query language (RDBMS/SQL) queries faster than is possible using existing state-of-the-art databases. Tensor SQL is optimized for sparse linear algebra problems and other whole-table queries. Currently, the database is being used only for research and program development. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Roose, Jonathan↗

Final Scientific/Technical Report

In this work, we have built upon our results from previous DOE funding (DEFG 0204ER25655), where we developed new and more efficient methods for solving certain optimization problems with many inequality constraints. This past work resulted in efficient algorithms (and analysis of their convergence) for linear programming, convex quadratic programming, and the training of support vector machines. The algorithms are based on using constraint reduction in interior point methods: at each iteration we consider only a smaller subset of the inequality constraints, focusing on the constraints that are close enough to be relevant. Surprisingly, we have been able to show theoretically that such algorithms are globally convergent and to demonstrate experimentally that they are much more efficient than standard interior point methods.

97 MATHEMATICS AND COMPUTING↗

Lattice Element Error Solver for Modeling of Accelerators, Storage Ring, Transport Systems, and Insertion Devices

The goals of CRADA 350 were achieved in this Phase I SBIR work. Specifically, a software environment was developed which included a nonlinear solver, OASIS. During the Phase I work, we applied the algorithm to a number of nonlinear-solver benchmark problems, including SLAC accelerator problems. By searching over only two optimization-control parameters, this Phase I work has enabled the development of a systematic procedure to facilitate the finding of a “best-guessed” global minimum solution for various types of non-linear problems with different size and complexity. This set of rules was codified and led to a versatile nonlinear program, IMIGO.

43 PARTICLE ACCELERATORS↗

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

Guide to a condensed form of NASTRAN

A limited capability form of NASTRAN level 16 is presented to meet the needs of universities and small consulting firms. The input cards, the programming language of the direct matrix abstraction program, the plotting, the problem definition, and the modules' diagnostic messages are described. Sample problems relating to the analysis of linear static, vibration, and buckling are included. This guide can serve as a handbook for instructional courses in the use of NASTRAN or for users who need only the capability provided by the condensed form.

Rogers, J. L., Jr.↗

HADY-I, a FORTRAN program for the compressible stability analysis of three-dimensional boundary layers

A computer program HADY-I for calculating the linear incompressible or compressible stability characteristics of the laminar boundary layer on swept and tapered wings is described. The eigenvalue problem and its adjoint arising from the linearized disturbance equations with the appropriate boundary conditions are solved numerically using a combination of Newton-Raphson interative scheme and a variable step size integrator based on the Runge-Kutta-Fehlburh fifth-order formulas. The integrator is used in conjunction with a modified Gram-Schmidt orthonormalization procedure. The computer program HADY-I calculates the growth rates of crossflow or streamwise Tollmien-Schlichting instabilities. It also calculates the group velocities of these disturbances. It is restricted to parallel stability calculations, where the boundary layer (meanflow) is assumed to be parallel. The meanflow solution is an input to the program.

El-Hady, N. M.↗

Strategic Analysis of Complex Security Scenarios

Many advanced technical tools are available to prevent attacks on national infrastructure. Nevertheless, while traditional analyses of security problems have succeeded in producing good technical solutions, they have often ignored the human factor integral to these problems. Human attackers (who may be individuals or state-level attackers) expend substantial effort to breach security because they have the incentive for doing so. People involved in implementing security follow individual incentives, which need not align with global security concerns; consequently, desired security solutions are often implemented poorly, or not at all. This complex interplay between individual incentives and global (organizational and/or national) goals can be modeled and analyzed using game theoretic techniques. By analyzing not only what is possible, but also what is motivated, a holistic approach to security problems can be developed, informing policy and providing tools to policy makers. We study game theoretic models that unify several current incentive-based approaches to security, and develop simulation-based and mathematical optimization methods for analyzing such models that exploit the high-performance computing capabilities at Sandia. Our first model studies security in interdependent settings, offering a scalable local search heuristic to approximate optimal security decisions in general, and a linear programming approach, coupled with simulations of consequences, to optimally compute security in an important special case. Our second class of models addresses security patrolling problems when an adversary gets to observe the patrol location. We present a general framework, based on stochastic games, for computing optimal security policies in such settings, and present more scalable tools that apply in the important special cases. Our third contribution is a model of security that involves many defenders, but only models non-adaptive attackers (or natural disasters, inadvertent errors, etc). In this model, we demonstrate that the security decisions of many players result in global security configuration that is not very far from optimal, and is much more resilient to environment changes that an optimal solution. This positive effect dissipates, however, when the number of decision makers becomes too large.

Vorobeychik, Yevgeniy↗

The Ramping Polytope and Cut Generation for the Unit Commitment Problem

We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramp-up/ramp-down constraints, time-dependent start-up costs, and start-up/shut-down limits. To develop this perfect formulation, we extend the result of Balas on unions of polyhedra to present a framework allowing for flexible combinations of polyhedra using indicator variables. Here, we use this perfect formulation to create a cut-generating linear program, similar in spirit to lift-and-project cuts, and demonstrate computational efficacy of these cuts in a utility-scale unit commitment problem.

97 MATHEMATICS AND COMPUTING↗

Data-Enabled Building Energy Savings (D-E BES)

Building sector energy consumption represents a significant fraction of the overall energy consumption in urban communities. While there has been increasing focus on the development of smart environments to support energy savings in urban commercial buildings, the development of smart environments for the residential sector has been less common. Instead, urban residential energy-saving efforts have focused on improving a building's physical infrastructure, introducing energy-saving appliances, and motivating residents to adopt energy conservation practices. Herein this paper illustrates that creating an affinity between a building resident's thermal preferences and a building apartment's unregulated thermal environment represents an alternative means of generating an energy-efficient environment for multi-family, residential buildings. Two years of 15-min interval summer data, obtained from smart cyber-physical systems installed in 310 apartments across two New York City buildings, is used to develop data-enabled (D-E) models of resident thermal preference and unregulated apartment temperatures. Both of these models use a linear mixed-effects approach. The alignment of optimal resident-apartment pairs is then formulated as an integer-programming problem to explore the building energy saving (BES) potential associated with minimizing the difference between unregulated apartment temperature and the residents' thermal preference based on summer cooling loads. The work shows that the energy saving potential vary with a building's physical characteristics as well as the variation in residents' thermal preferences. The work further demonstrates that both the unregulated temperature and the resident's preferred temperature in a given apartment are not only affected by outside temperature and external relative humidity, but also strongly affected by the apartment's geographic orientation. For the specific buildings considered, up to 28% cooling energy saving is possible with full alignment. The paper provides all building monitoring data as an open source data set.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

99 GENERAL AND MISCELLANEOUS↗

Inconsistent Investment and Consumption Problems

In a traditional Black–Scholes market we develop a verification theorem for a general class of investment and consumption problems where the standard dynamic programming principle does not hold. The theorem is an extension of the standard Hamilton–Jacobi–Bellman equation in the form of a system of non-linear differential equations. We derive the optimal investment and consumption strategy for a mean-variance investor without pre-commitment endowed with labor income. In the case of constant risk aversion it turns out that the optimal amount of money to invest in stocks is independent of wealth. The optimal consumption strategy is given as a deterministic bang-bang strategy. In order to have a more realistic model we allow the risk aversion to be time and state dependent. Of special interest is the case were the risk aversion is inversely proportional to present wealth plus the financial value of future labor income net of consumption. Using the verification theorem we give a detailed analysis of this problem. It turns out that the optimal amount of money to invest in stocks is given by a linear function of wealth plus the financial value of future labor income net of consumption. The optimal consumption strategy is again given as a deterministic bang-bang strategy. We also calculate, for a general time and state dependent risk aversion function, the optimal investment and consumption strategy for a mean-standard deviation investor without pre-commitment. In that case, it turns out that it is optimal to take no risk at all.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A note on the S-matrix bootstrap for the 2d O(N) bosonic model

In this work we apply the S-matrix bootstrap maximization program to the 2d bosonic O ( N ) integrable model which has N species of scalar particles of mass m and no bound states. Since in previous studies theories were defined by maximizing the coupling between particles and their bound states, the main problem appears to be to find what other functional can be used to define this model. Instead, we argue that the defining property of this integrable model is that it resides at a vertex of the convex space determined by the unitarity and crossing constraints. Thus, the integrable model can be found by maximizing any linear functional whose gradient points in the general direction of the vertex, namely within a cone determined by the normals to the faces intersecting at the vertex. This is a standard problem in applied mathematics, related to semi-definite programming and solvable by fast available numerical algorithms. The information provided by the numerical solution is enough to reproduce the known analytical solution without using integrability, namely the Yang-Baxter equation. This situation seems quite generic so we expect that other theories without continuous parameters can also be found by maximizing linear functionals in the convex space of allowed S-matrices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Level set topology optimization of structural problems with interface cohesion

Summary This paper presents a finite element topology optimization framework for the design of two‐phase structural systems considering contact and cohesion phenomena along the interface. The geometry of the material interface is described by an explicit level set method, and the structural response is predicted by the extended finite element method. In this work, the interface condition is described by a bilinear cohesive zone model on the basis of the traction‐separation constitutive relation. The non‐penetration condition in the presence of compressive interface forces is enforced by a stabilized Lagrange multiplier method. The mechanical model assumes a linear elastic isotropic material, infinitesimal strain theory, and a quasi‐static response. The optimization problem is solved by a nonlinear programming method, and the design sensitivities are computed by the adjoint method. The performance of the presented method is evaluated by 2D and 3D numerical examples. The results obtained from topology optimization reveal distinct design characteristics for the various interface phenomena considered. In addition, 3D examples demonstrate optimal geometries that cannot be fully captured by reduced dimensionality. The optimization framework presented is limited to two‐phase structural systems where the material interface is coincident in the undeformed configuration, and to structural responses that remain valid considering small strain kinematics. Copyright © 2017 John Wiley & Sons, Ltd.

Behrou, Reza↗

Complementary variational principle and duality in mathematical programming.

The relationship between the complementary variational principle and duality in mathematical programming is demonstrated through a geometric approach in a Hilbert space setting. A necessary and sufficient condition for the existence of such a principle is given in the case of a convex functional constrained by linear dynamics. Its relationship to the Kuhn-Tucker saddle point theory is indicated. Applications to various programming and control problems are discussed.

Chan, W. L.↗

Control optimization, stabilization and computer algorithms for aircraft applications

Research related to reliable aircraft design is summarized. Topics discussed include systems reliability optimization, failure detection algorithms, analysis of nonlinear filters, design of compensators incorporating time delays, digital compensator design, estimation for systems with echoes, low-order compensator design, descent-phase controller for 4-D navigation, infinite dimensional mathematical programming problems and optimal control problems with constraints, robust compensator design, numerical methods for the Lyapunov equations, and perturbation methods in linear filtering and control.

Source record↗

A user oriented microcomputer facility for designing linear quadratic Gaussian feedback compensators

The paper describes a laboratory design facility for digital microprocessor implementation of Linear-Quadratic-Gaussian feedback compensators. Outputs from user interactive programs for solving infinite time horizon LQ regulator and Kalman filter problems are conditioned for implementation on a laboratory microcomputer system. The software consists of two parts: (1) an off-line high-level program for solving the LQ Ricatti equations and generating associated feedback and filter gains, and (2) a cross compiler/macro assembler which generates object code for the target microprocessor system. Application to the control of a two dimensional inverted pendulum and expanding the design/prototyping system to other target machine architectures are discussed.

Houpt, P. K.↗

Synthesizing Monitors for Safety Properties

The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in time analysis of software. An algorithm which takes a past time LTL formula and generates an efficient dynamic programming algorithm is presented. The generated algorithm tests whether the formula is satisfied by a finite trace of events given as input and runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula. Further optimizations of the algorithm are suggested. Past time operators suitable for writing succinct specifications axe introduced and shown definitionally equivalent to the standard operators. This work is part of the PathExplorer project, the objective of which it is to construct a flexible framework for monitoring and analyzing program executions.

Havelund, Klaus↗