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

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↗

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↗

Stochastic robust mathematical programming model for power system optimization

We present a stochastic robust framework for two-stage power system optimization problems with uncertainty. The model optimizes the probabilistic expectation of different worst-case scenarios with different uncertainty sets. In addition, a case study of unit commitment shows the effectiveness of the proposed model and algorithms.

97 MATHEMATICS AND COMPUTING↗

Fast, Dynamic, and Scalable Algorithms for Large-Scale Constrained Optimization

Scientists and engineers constantly aim to optimize an objective subject to physical, environmental, and/or resource constraints. The technique of using mathematical models to formulate and find real solutions of such problems is known as mathematical optimization, a process that has become invaluable for design and discovery in numerous scientific fields. This project has focused on the design, analysis, and implementation of high-performance computing algorithms for solving cutting-edge optimization problems. These include problems that involve (1) data uncertainties, such as those in the future supply, demand, and capacity of a given power system, (2) extreme numbers of alternatives, such as in the design of electrical power grids to avoid network vulnerabilities, and (3) real-time decisions, such as in the control of chemical reactors. The key features of the new algorithms are that they are fast, dynamic, and scalable to meet the computational requirements of scientists and researchers working to optimize large-scale, complex systems. The algorithms that have been designed, analyzed, and tested as part of the project can be characterized based on the types of optimization problems they have been designed to solve. Much of the work has focused on algorithms for solving large-scale constrained optimization problems. Contributions have also been made in the design of algorithms for unconstrained optimization, with some specialized methods for solving problems that have inherent nonsmoothness. Contributions have also been made in areas that have grown to prominence in the field over the five-year award period. These include the design of algorithms for solving large-scale stochastic optimization problems, such as those that arise in large-scale machine learning, and in complexity analyses for solving nonconvex problems, which has been a focal point of much recent work in continuous optimization. Overall, the project has supported work that has led to almost 30 articles that have been published or accepted to top journals in the field of mathematical optimization.

97 MATHEMATICS AND COMPUTING↗

Chance-Constrained Optimization for Critical Infrastructure Protection

Stochastic optimization deals with making highly reliable decisions under uncertainty. Chance constraints are a crucial tool of stochastic optimization to develop mathematical optimization models; they form the backbone of many important national security data science applications. These include critical infrastructure resiliency, cyber security, power system operations, and disaster relief management. However, existing algorithms to solve chance-constrained optimization models are severely limited by problem size and structure. In this investigative study, we (i) develop new algorithms to approximate chance-constrained optimization models, (ii) demonstrate the application of chance-constraints to a national security problem, and (iii) investigate related stochastic optimization problems. We believe our work will pave way for new research is stochastic optimization as well as secure national infrastructures against unforeseen attacks.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Improving Data Transfer Throughput with Direct Search Optimization

Improving data transfer throughput over high-speed long-distance networks has become increasingly difficult. Numerous factors such as nondeterministic congestion, dynamics of the transfer protocol, and multiuser and multitask source and destination endpoints, as well as interactions among these factors, contribute to this difficulty. A promising approach to improving throughput consists in using parallel streams at the application layer.We formulate and solve the problem of choosing the number of such streams from a mathematical optimization perspective. We propose the use of direct search methods, a class of easy-to-implement and light-weight mathematical optimization algorithms, to improve the performance of data transfers by dynamically adapting the number of parallel streams in a manner that does not require domain expertise, instrumentation, analytical models, or historic data. We apply our method to transfers performed with the GridFTP protocol, and illustrate the effectiveness of the proposed algorithm when used within Globus, a state-of-the-art data transfer tool, on productionWAN links and servers. We show that when compared to user default settings our direct search methods can achieve up to 10x performance improvement under certain conditions. We also show that our method can overcome performance degradation due to external compute and network load on source end points, a common scenario at high performance computing facilities.

Balaprakash, Prasanna↗

SU-E-I-23: A General KV Constrained Optimization of CNR for CT Abdominal Imaging

Purpose: While Tube current modulation has been well accepted for CT dose reduction, kV adjusting in clinical settings is still at its early stage. This is mainly due to the limited kV options of most current CT scanners. kV adjusting can potentially reduce radiation dose and optimize image quality. This study is to optimize CT abdomen imaging acquisition based on the assumption of a continuous kV, with the goal to provide the best contrast to noise ratio (CNR). Methods: For a given dose (CTDIvol) level, the CNRs at different kV and pitches were measured with an ACR GAMMEX phantom. The phantom was scanned in a Siemens Sensation 64 scanner and a GE VCT 64 scanner. A constrained mathematical optimization was used to find the kV which led to the highest CNR for the anatomy and pitch setting. Parametric equations were obtained from polynomial fitting of plots of kVs vs CNRs. A suitable constraint region for optimization was chosen. Subsequent optimization yielded a peak CNR at a particular kV for different collimations and pitch setting. Results: The constrained mathematical optimization approach yields kV of 114.83 and 113.46, with CNRs of 1.27 and 1.11 at the pitch of 1.2 and 1.4, respectively, for the Siemens Sensation 64 scanner with the collimation of 32 x 0.625mm. An optimized kV of 134.25 and 1.51 CNR is obtained for a GE VCT 64 slice scanner with a collimation of 32 x 0.625mm and a pitch of 0.969. At 0.516 pitch and 32 x 0.625 mm an optimized kV of 133.75 and a CNR of 1.14 was found for the GE VCT 64 slice scanner. Conclusion: CNR in CT image acquisition can be further optimized with a continuous kV option instead of current discrete or fixed kV settings. A continuous kV option is a key for individualized CT protocols.

60 APPLIED LIFE SCIENCES↗