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 541 records · Page 30

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Model Implementation (PART 1)

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

25 ENERGY STORAGE↗

Application of a sensitivity analysis technique to high-order digital flight control systems

A sensitivity analysis technique for multiloop flight control systems is studied. This technique uses the scaled singular values of the return difference matrix as a measure of the relative stability of a control system. It then uses the gradients of these singular values with respect to system and controller parameters to judge sensitivity. The sensitivity analysis technique is first reviewed; then it is extended to include digital systems, through the derivation of singular-value gradient equations. Gradients with respect to parameters which do not appear explicitly as control-system matrix elements are also derived, so that high-order systems can be studied. A complete review of the integrated technique is given by way of a simple example: the inverted pendulum problem. The technique is then demonstrated on the X-29 control laws. Results show linear models of real systems can be analyzed by this sensitivity technique, if it is applied with care. A computer program called SVA was written to accomplish the singular-value sensitivity analysis techniques. Thus computational methods and considerations form an integral part of many of the discussions. A user's guide to the program is included. The SVA is a fully public domain program, running on the NASA/Dryden Elxsi computer.

Paduano, James D.↗

NASA pyrotechnically actuated systems program

The Office of Safety and Mission Quality initiated a Pyrotechnically Actuated Systems (PAS) Program in FY-92 to address problems experienced with pyrotechnically actuated systems and devices used both on the ground and in flight. The PAS Program will provide the technical basis for NASA's projects to incorporate new technological developments in operational systems. The program will accomplish that objective by developing/testing current and new hardware designs for flight applications and by providing a pyrotechnic data base. This marks the first applied pyrotechnic technology program funded by NASA to address pyrotechnic issues. The PAS Program has been structured to address the results of a survey of pyrotechnic device and system problems with the goal of alleviating or minimizing their risks. Major program initiatives include the development of a Laser Initiated Ordnance System, a pyrotechnic systems data base, NASA Standard Initiator model, a NASA Standard Linear Separation System and a NASA Standard Gas Generator. The PAS Program sponsors annual aerospace pyrotechnic systems workshops.

Schulze, Norman R.↗

Squash-Box Feasibility Driven Differential Dynamic Programming

Recently, Differential Dynamic Programming (DDP) and other similar algorithms have become the solvers of choice when performing non-linear Model Predictive Control (nMPC) with modern robotic devices. The reason is that they have a lower computational cost per iteration when compared with off-the-shelf Non-Linear Programming (NLP) solvers, which enables its online operation. However, they cannot handle constraints, and are known to have poor convergence capabilities. In this paper, we propose a method to solve the optimal control problem with control bounds through a squashing function (i.e., a sigmoid, which is bounded by construction). It has been shown that a naive use of squashing functions damage the convergence rate. To tackle this, we first propose to add a quadratic barrier that avoids the difficulty of the plateau produced by the sigmoid. Second, we add an outer loop that adapts both the sigmoid and the barrier; it makes the optimal control problem with the squashing function converge to the original control-bounded problem. To validate our method, we present simulation results for different types of platforms including a multi-rotor, a biped, a quadruped and a humanoid robot.

Navarro, Angel Santamaria↗

Numerical marching techniques for fluid flows with heat transfer

The finite difference formulation and method of solution is presented for a wide variety of fluid flow problems with associated heat transfer. Only a few direct results from these formulations are given as examples, since the book is intended primarily to serve a discussion of the techniques and as a starting point for further investigations; however, the formulations are sufficiently complete that a workable computer program may be written from them. In the appendixes a number of topics are discussed which are of interest with respect to the finite difference equations presented. These include a very rapid method for solving certain sets of linear algebraic equations, a discussion of numerical stability, the inherent error in flow rate for confined flow problems, and a method for obtaining high accuracy with a relatively small number of mesh points.

Hornbeck, R. W.↗

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗

An inertia-free filter line-search algorithm for large-scale nonlinear programming

We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.

Chiang, Nai-Yuan↗

A Model Predictive Control Based Generator Start-Up Optimization Strategy for Restoration With Microgrids as Black-Start Resources

Microgrids (MGs) can operate in an islanded mode and serve as black-start resources for power system restoration (PSR). Here, a model predictive control (MPC) based generator start-up optimization strategy for PSR is proposed utilizing MGs as black-start resources. First, the generator start-up sequence (GSUS) optimization is formulated as a mixed integer linear programming. Then, the uncertainties of MG black-start resources (MBSRs) are modeled by discretizing the probability distribution of the forecast errors, and representative scenarios for MBSRs extracted by formulating the probability mass transportation problem. Third, the generator start-up optimization strategy considering MBSRs is proposed utilizing the MPC technique, in which the optimization objective is to maximize the energy capability of the power systems and minimize the load curtailment of the MGs in each looking-ahead interval. Simulations on the IEEE 118 bus system with MGs and Zhejiang provincial power system in China verify that the introduced strategy for PSR can successfully restore the power system and effectively determine the optimal GSUS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic Design Optimization of Microstructural Features Using Linear Programming for Robust Design

Microstructure design can have a substantial effect on the performance of critical components in numerous aerospace applications. However, the stochastic nature of metallic microstructures leads to deviations in material properties from the design point and alters the performance of these critical components. In this paper, a novel stochastic linear programming (LP) methodology is developed for microstructure design accounting for uncertainties in desired properties. The metallic microstructure is represented using a finite element discretized form of the orientation distribution function (ODF). The inverse LP problem solves the mean values and covariance matrix of the ODFs to maximize the mean values of a property, given the statistical constraints on other properties. The highlight is an analytical uncertainty quantification model via a Gaussian distribution to model propagation of microstructural uncertainties to the properties. Examples illustrate maximization of the yield strength and magnetostriction of a galfenol alloy when constrained by uncertainties in a set of stiffness constants.

42 ENGINEERING↗

Numerical method for solution of systems of non-stationary spatially one-dimensional nonlinear differential equations

A computational scheme and a standard program is proposed for solving systems of nonstationary spatially one-dimensional nonlinear differential equations using Newton's method. The proposed scheme is universal in its applicability and its reduces to a minimum the work of programming. The program is written in the FORTRAN language and can be used without change on electronic computers of type YeS and BESM-6. The standard program described permits the identification of nonstationary (or stationary) solutions to systems of spatially one-dimensional nonlinear (or linear) partial differential equations. The proposed method may be used to solve a series of geophysical problems which take chemical reactions, diffusion, and heat conductivity into account, to evaluate nonstationary thermal fields in two-dimensional structures when in one of the geometrical directions it can take a small number of discrete levels, and to solve problems in nonstationary gas dynamics.

Morozov, S. K.↗

On-board radiometric preprocessing for multispectral linear arrays /MLA/

A program that was undertaken to design, fabricate, and test a real-time hardwired data preprocessor is described, which applies a calibration normalization to each detector in a 576-element linear photodiode array. Various calibration problems were uncovered, such as those (1) due to system noise in recording the calibration tables, or (2) due to thermal drift and (3) due to the original quantization process. It was determined that in this experiment, noise and thermal drift led to fixed errors in the normalization of responses on the order of + or - 10 counts, out of 255 counts for many of the detectors.

Thompson, L. L.↗

Structural design for dynamic response reduction

A computer program for redesigning structural modes to reduce response has been initiated. The linear regulator approach in modal coordinates has been implemented. It is noted that the transformation of solution to physical structure is a major problem. It is concluded that the solution of stiffness equations and damping equations can be done separately as NXN set of (matrix Riccati) equations.

Hanks, B. R.↗

Dynamics of Nuclear Regions of Galaxies

Current research carried out with the help of the ASEE-NASA Summer Faculty Program, at NASA-Ames, is concentrated on the dynamics of nuclear regions of galaxies. From a dynamical point of view a galaxy is a collection of around 10(sup 11) stars like our Sun, each of which moves in the summed gravitational field of all the remaining stars. Thus galaxy dynamics becomes a self-consistent n-body problem with forces given by Newtonian gravitation. Strong nonlinearity in the gravitational force and the inherent nonlinearity of self-consistent problems both argue for a numerical approach. The technique of numerical experiments consis of constructing an environment in the computer that is as close as possible to the physical conditions in a real galaxy and then carrying out experiments much like laboratory experiments in physics or engineering, in this environment. Computationally, an experiment is an initial value problem, and a good deal of thought and effort goes into the design of the starting conditions that serve as initial values. Experiments are run at Ames because all the 'equipment' is in place-the programs, the necessary computational power, and good facilities for post-run analysis. Our goal for this research program is to study the nuclear regions in detail and this means replacing most of the galaxy by a suitable boundary condition to allow the full capability of numerical experiments to be brought to bear on a small region perhaps 1/1000 of the linear dimensions of an entire galaxy. This is an extremely delicate numerical problem, one in which some small feature overlook, can easily lead to a collapse or blow-up of the entire system. All particles attract each other in gravitational problems, and the 1/r(sup 2) force is: (1) nonlinear; (2) strong at short range; (3) long-range, and (4) unscreened at any distance.

Miller, Richard H.↗

A modified homotopy method for solving the principal-agent bilevel programming problem

In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.

97 MATHEMATICS AND COMPUTING↗

Near-Optimal Solutions for Day-Ahead Unit Commitment

Given the difficulty and the time pressure of solving unit commitment problems, near -optimal solutions (those with 0.1 or 0.001% optimality gaps) are often used in practice. The choice in which of the near -optimal solutions is used, however, is random. We investigate the impact of solution choice on the revenues obtained by generator owners across a variety of pricing schemes and problem instances.

market-clearing↗

WE-AB-207B-11: Optimizing Tumor Control Probability in Radiation Therapy Treatment - Application to HDR Cervical Cancer

Purpose: The ultimate goal of radiotherapy treatment planning is to find a treatment that will yield a high tumor-control-probability(TCP) with an acceptable normal-tissue-complication probability(NTCP). Yet most treatment planning today is not based upon optimization of TCPs and NTCPs, but rather upon meeting physical dose and volume constraints defined by the planner. We design treatment plans that optimize TCP directly and contrast them with the clinical dose-based plans. PET image is incorporated to evaluate gain in TCP for dose escalation. Methods: We build a nonlinear mixed integer programming optimization model that maximizes TCP directly while satisfying the dose requirements on the targeted organ and healthy tissues. The solution strategy first fits the TCP function with a piecewise-linear approximation, then solves the problem that maximizes the piecewise linear approximation of TCP, and finally performs a local neighborhood search to improve the TCP value. To gauge the feasibility, characteristics, and potential benefit of PET-image guided dose escalation, initial validation consists of fifteen cervical cancer HDR patient cases. These patients have all received prior 45Gy of external radiation dose. For both escalated strategies, we consider 35Gy PTV-dose, and two variations (37Gy-boost to BTV vs 40Gy-boost) to PET-image-pockets. Results: TCP for standard clinical plans range from 59.4% - 63.6%. TCP for dose-based PET-guided escalated-dose-plan ranges from 63.8%–98.6% for all patients; whereas TCP-optimized plans achieves over 91% for all patients. There is marginal difference in TCP among those with 37Gy-boosted vs 40Gy-boosted. There is no increase in rectum and bladder dose among all plans. Conclusion: Optimizing TCP directly results in highly conformed treatment plans. The TCP-optimized plan is individualized based on the biological PET-image of the patients. The TCP-optimization framework is generalizable and has been applied successfully to other external-beam delivery modalities. A clinical trial is on-going to gauge the clinical significance. Partially supported by the National Science Foundation.

60 APPLIED LIFE SCIENCES↗

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗

Control system optimization studies. Volume 2: High frequency cutoff filter analysis

The problem of digital implementation of a cutoff filter is approached with consideration to word length, sampling rate, accuracy requirements, computing time and hardware restrictions. Computing time and hardware requirements for four possible programming forms for the linear portions of the filter are determined. Upper bounds for the steady state system output error due to quantization for digital control systems containing a digital network programmed both in the direct form and in the canonical form are derived. This is accomplished by defining a set of error equations in the z domain and then applying the final value theorem to the solution. Quantization error was found to depend upon the digital word length, sampling rate, and system time constants. The error bound developed may be used to estimate the digital word length and sampling rate required to achieve a given system specification. From the quantization error accumulation, computing time and hardware point of view, and the fact that complex poles and zeros must be realized, the canonical form of programming seems preferable.

Fong, M. H.↗