Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical optimization”

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

Mathematical optimization of photovoltaic converters for diode lasers

The mathematical optimization of vertical-junction photovoltaic converters for use with diode laser arrays supplying powers up to 1 MW is discussed. Photovoltaic parameters were optimized using a mathematical model. The optimized converters have 500 single junctions connected in series. The efficiency varies from 41 percent for a 0.73-micron diode laser to 46 percent for a 0.83-micron diode laser. The optimum width of the single-junction converter is small, 3.0 microns, in order for the p-n junction to be within a diffusion length of the light-generated carriers. Another critical parameter is the series resistance; the optimum value of 0.001 ohms should be achievable. Another critical parameter is the donor carrier concentration, for which an optimum value of 5 x 10 to the 15th carriers/cu cm has been chosen.

Walker, Gilbert H.↗

Mathematical Optimization Techniques

The papers collected in this volume were presented at the Symposium on Mathematical Optimization Techniques held in the Santa Monica Civic Auditorium, Santa Monica, California, on October 18-20, 1960. The objective of the symposium was to bring together, for the purpose of mutual education, mathematicians, scientists, and engineers interested in modern optimization techniques. Some 250 persons attended. The techniques discussed included recent developments in linear, integer, convex, and dynamic programming as well as the variational processes surrounding optimal guidance, flight trajectories, statistical decisions, structural configurations, and adaptive control systems. The symposium was sponsored jointly by the University of California, with assistance from the National Science Foundation, the Office of Naval Research, the National Aeronautics and Space Administration, and The RAND Corporation, through Air Force Project RAND.

Bellman, R.↗

Strong profiling is not mathematically optimal for discovering rare malfeasors

In a large population of individuals labeled j = 1,2,...,N, governments attempt to find the rare malfeasor j = j, (terrorist, for example) by making use of priors p{sub j} that estimate the probability of individual j being a malfeasor. Societal resources for secondary random screening such as airport search or police investigation are concentrated against individuals with the largest priors. They may call this 'strong profiling' if the concentration is at least proportional to p{sub j} for the largest values. Strong profiling often results in higher probability, but otherwise innocent, individuals being repeatedly subjected to screening. They show here that, entirely apart from considerations of social policy, strong profiling is not mathematically optimal at finding malfeasors. Even if prior probabilities were accurate, their optimal use would be only as roughly the geometric mean between a strong profiling and a completely uniform sampling of the population.

97 MATHEMATICS AND COMPUTING↗

Mathematical Optimization of NGCC Solvent-based Carbon Capture Processes to Explore High Capture Designs

For point-source capture, much of the work to date has focused on achieving 90% capture – a somewhat arbitrary target above which parasitic losses to drive carbon capture and compression systems were believed to be too great to be economically justifiable. The recent push for deep decarbonization has caused this target to be revisited, and existing literature is of limited usefulness as most published studies have focused on carbon capture percentages of 90%. In this work, numerous mathematical optimizations were performed between carbon capture targets between 90%-99.8% of a Natural Gas Combined Cycle (NGCC) plant to better understand incremental cost of these systems so they may be compared to other decarbonization technologies, and to inform technical risk associated with targeting higher capture performance for these types of systems.

carbon capture↗

Development and Utilization of mathematical Optimization in Advanced Fuel Cycle Systems Analysis

Over the past sixty years, a wide variety of nuclear power technologies have been theorized, investigated and tested to various degrees. These technologies, if properly applied, could provide a stable, long-term, economical source of CO2-free electric power. However, the recycling of nuclear fuel introduces a degree of coupling between reactor systems which must be accounted for when making long term strategic plans. This work investigates the use of a simulated annealing optimization algorithm coupled together with the VISION fuel cycle simulation model in order to identify attractive strategies from economic, evironmental, non-proliferation and waste-disposal perspectives, which each have associated an objective function. The simulated annealing optimization algorithm works by perturbing the fraction of new reactor capacity allocated to each available reactor type (using a set of heuristic rules) then evaluating the resulting deployment scenario outcomes using the VISION model and the chosen objective functions. These new scenarios, which are either accepted or rejected according the the Metropolis Criterion, are then used as the basis for further perturbations. By repeating this process several thousand times, a family of near-optimal solutions are obtained. Preliminary results from this work using a two-step, Once-through LWR to Full-recycle/FRburner deployment scenario with exponentially increasing electric demand indicate that the algorithm is capable of nding reactor deployment pro les that reduce the long-term-heat waste disposal burden relative to an initial reference scenario. Further work is under way to re ne the current results and to extend them to include the other objective functions and to examine the optimization trade-o s that exist between these di erent objectives.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Application of mathematical optimization procedures to a structural model of a large finite-element wing

An optimization system is described that consists of the finite-element analysis program known as Engineering Analysis Language (EAL), the CONMIN optimization program, and a piecewise linear analysis. The optimization analysis system (OPTEAL) is used to minimize the mass of a transport wing subject to stress constraints for two static load conditions. The optimization procedure and the optimization analysis system (OPTEAL) are described and the optiomized results with fully stressed design results compared.

Walsh, J. L.↗

Structural damage identification using mathematical optimization techniques

An identification procedure is proposed to identify damage characteristics (location and size of the damage) from dynamic measurements. This procedure was based on minimization of the mean-square measure of difference between measurement data (natural frequencies and mode shapes) and the corresponding predictions obtained from the computational model. The procedure is tested for simulated damage in the form of stiffness changes in a simple fixed free spring mass system and symmetric cracks in a simply supported Bernoulli Euler beam. It is shown that when all the mode information is used in the identification procedure it is possible to uniquely determine the damage properties. Without knowing the complete set of modal information, a restricted region in the initial data space has been found for realistic and convergent solution from the identification process.

Shen, Mo-How Herman↗

Block-oriented modeling of superstructure optimization problems

We present a novel software framework for modeling large-scale engineered systems as mathematical optimization problems. A key motivating feature in such systems is their hierarchical, highly structured topology. Existing mathematical optimization modeling environments do not facilitate the natural expression and manipulation of hierarchically structured systems. Rather, the modeler is forced to "flatten" the system description, hiding structure that may be exploited by solvers, and obfuscating the system that the modeling environment is attempting to represent. To correct this deficiency, we propose a Python-based "block-oriented" modeling approach for representing the discrete components within the system. Our approach is an extension of the Pyomo library for specifying mathematical optimization problems. Through the use of a modeling components library, the block-oriented approach facilitates a clean separation of system superstructure from the details of individual components. This approach also naturally lends itself to expressing design and operational decisions as disjunctive expressions over the component blocks. By expressing a mathematical optimization problem in a block-oriented manner, inherent structure (e.g., multiple scenarios) is preserved for potential exploitation by solvers. In particular, we show that block-structured mathematical optimization problems can be straightforwardly manipulated by decomposition-based multi-scenario algorithmic strategies, specifically in the context of the PySP stochastic programming library. We illustrate our block-oriented modeling approach using a case study drawn from the electricity grid operations domain: unit commitment with transmission switching and N - 1 reliability constraints. Finally, we demonstrate that the overhead associated with block-oriented modeling only minimally increases model instantiation times, and need not adversely impact solver behavior. (C) 2013 Elsevier Ltd. All rights reserved.

Friedman, Z↗

Predicting Characteristics of the Water Cycle From Scaling Relationships

Over multi-decadal time scales, assuming that changes in subsurface water storage are negligible, the continental precipitative water flux, P, can be divided into two principal components, Q (run-off, including soil infiltration and groundwater recharge) and ET (evapotranspiration). Taking into account a broadly applied Budyko's phenomenology to describe the relationship of ET/P as a function of PET/P, where PET is the potential evapotranspiration, we propose a theoretical framework for predicting characteristics of the water cycle from scaling relationships. In this framework, the ecosystem net primary productivity is expressed in terms of soil formation and vegetation growth, which is mathematically optimized with respect to the water partitioning, generating directly the value ET/P. Here, the mathematical optimization is based on the general ecological principle that dominant ecosystems tend to be those that, for any given conditions, maximize conversion of atmospheric carbon to biomass. It is shown that application of the results of mathematical optimization to water-limited ecosystems is possible by applying the optimization only to a vegetation covered portion of the surface. For energy-limited ecosystems, the optimization can be applied only to a portion of the precipitation equal to PET, assuming that the remaining P simply runs off. We use theoretical and actual values of plant root fractal dimensionalities, d f , to predict ranges of ET/P as a function of PET/P for 0 ≤ PET/P ≤ 1 and compare with annual and multi-decadal means of ET/P. By comparing the developed approach with a large amount of data collected from the literature, we demonstrate its successful applications to both water- and energy-limited systems.

54 ENVIRONMENTAL SCIENCES↗