Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical 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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

Helicopter rotor blade aerodynamic optimization by mathematical programming

Formal mathematical programing was applied to the aerodynamic rotor blade design process. The approach is to couple hover and forward flight analysis programs with the general-purpose optimization program CONMIN to determine the blade taper ratio, percent taper, twist distribution, and solidity which minimize the horsepower required at hover while meeting constraints on forward flight performance. Designs obtained using this approach for the blade of a representative Army helicopter compare well with those obtained using a conventional approach involving personnel-intensive parametric studies. Results from the present method can be obtained in 2 days as compared to 5 weeks required by the conventional procedure. Also the systematic manipulation of the design variables by the optimization procedure minimizes the need for the researcher to have a vast body of past experience and data in determining the influence of a design change on the performance.

Walsh, J. L.↗
NASA NTRS1989

Calculation of shocked flows by mathematical programming

A framework for using mathematical programming to solve Burgers' equation is presented. The steady-state inviscid Burgers' equation with given boundary conditions is considered, and the physically relevant solution is discretized using a four-point difference scheme for the viscous term and a two-point difference scheme for the inviscid term. The framework is then used to solve the Euler equations for quasi-one-dimensional flows on grids with variable spacing.

Lavery, John E.↗
NASA NTRS1986

Alternative mathematical programming formulations for FSS synthesis

A variety of mathematical programming models and two solution strategies are suggested for the problem of allocating orbital positions to (synthesizing) satellites in the Fixed Satellite Service. Mixed integer programming and almost linear programming formulations are presented in detail for each of two objectives: (1) positioning satellites as closely as possible to specified desired locations, and (2) minimizing the total length of the geostationary arc allocated to the satellites whose positions are to be determined. Computational results for mixed integer and almost linear programming models, with the objective of positioning satellites as closely as possible to their desired locations, are reported for three six-administration test problems and a thirteen-administration test problem.

Reilly, C. H.↗
NASA NTRS1973

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.↗
NASA NTRS1987

Mathematical programming formulations for satellite synthesis

The problem of satellite synthesis can be described as optimally allotting locations and sometimes frequencies and polarizations, to communication satellites so that interference from unwanted satellite signals does not exceed a specified threshold. In this report, mathematical programming models and optimization methods are used to solve satellite synthesis problems. A nonlinear programming formulation which is solved using Zoutendijk's method and a gradient search method is described. Nine mixed integer programming models are considered. Results of computer runs with these nine models and five geographically compatible scenarios are presented and evaluated. A heuristic solution procedure is also used to solve two of the models studied. Heuristic solutions to three large synthesis problems are presented. The results of our analysis show that the heuristic performs very well, both in terms of solution quality and solution time, on the two models to which it was applied. It is concluded that the heuristic procedure is the best of the methods considered for solving satellite synthesis problems.

Bhasin, Puneet↗
NASA NTRS1989

Solution of steady-state one-dimensional conservation laws by mathematical programming

Solution techniques for a class of steady-state scalar conservation laws are developed analytically. Discretization by finite-volume formulas is employed to obtain an overdetermined system of algebraic equations, which are then perturbed nonsingularly (with perturbation coefficient = epsilon) and solved using the l(1) mathematical-programming algorithm of Seneta and Steiger (1984); this approach limits the matrix bandwidth to two, so that an explicit solution can be found efficiently. It is shown that, for small values of epsilon, the l(1) solutions exhibit sharp correctly located shocks and are nonoscillatory O(epsilon) approximations of the physically relevant solutions.

Lavery, J. E.↗
NASA NTRS1973

A method for digital image registration using a mathematical programming technique

A new algorithm based on a nonlinear programming technique to correct the geometrical distortions of one digital image with respect to another is discussed. This algorithm promises to be superior to existing ones in that it is capable of treating localized differential scaling, translational and rotational errors over the whole image plane. A series of piece-wise 'rubber-sheet' approximations are used, constrained in such a manner that a smooth approximation over the entire image can be obtained. The theoretical derivation is included. The result of using the algorithm to register four channel S065 Apollo IX digitized photography over Imperial Valley, California, is discussed in detail.

Yao, S. S.↗
NASA NTRS1979

Wing shape optimization for maximum cross-country speed, with mathematical programming

A computer program was developed to calculate numerically the speed and circling polars of an aircraft when the lift and drag characteristics of the wing airfoils are known. The planform of the wing is described by variables which are optimized so that the cross-country speed of the glider is maximum for the particular type of thermal model. Two thermal models are compared and shown that with a greater wing area than now normally used the performance can be increased.

Helwig, G.↗