Search NASA⌕ Search

SEARCH · Search NASA

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 217 records · Page 12

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY↗

SENTRA: A Modular Computational Graph Framework for Critical Mineral and Materials Supply Chains: Part I: Network Construction Latent-Quantity Estimation, and Temporal Graph Forecasting

Global supply chains for critical minerals and materials are complex, evolving networks of countries, products, production stages, and trade relationships. Existing analytical approaches are limited by fragmented data and static network representations that do not capture the dynamic production dependencies linking raw materials, intermediate products, and final goods across multiple countries. Trade and production statistics provide only a partial view of domestic production, inventories, and material flows, making it difficult to identify indirect sourcing pathways, hidden dependencies, and embedded foreign exposures. This paper introduces the Supply Chain Exposure Network Tracking and Risk Assessment (SENTRA) framework, a modular graph-based computational framework for constructing, analyzing, and forecasting dynamic supply chain networks. As the first paper in a three-part methodological series, it establishes the computational foundation of SENTRA by constructing a temporal attributed multi-relational graph whose nodes represent product–country pairs and whose edges encode observed trade and within-country value-chain relationships. Statistical estimation and constrained optimization recover latent production, final demand, and product input dependency coefficients while enforcing economic accounting constraints. Graph-derived exposure measures quantify direct, transshipment, value-chain, and multi-hop supply chain dependencies independently of the forecasting model. A temporal graph forecasting architecture based on a relational graph neural network then forecasts the evolution of the graph under mass-balance constraints with distribution-free conformal uncertainty quantification. Validation on the global aluminum supply chain shows that the learned graph representations recover economically meaningful supply chain structure, accurately forecast out-of-sample trade relationships, and produce well-calibrated prediction intervals. Subsequent papers apply this computational foundation to exposure assessment, disruption analysis, and scenario-based policy analysis, and extend the framework to multimaterial supply chain modeling and decision support.

36 MATERIALS SCIENCE↗

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗

Decision-making based on Markov decision process in integrated artificial reasoning framework—Part I: Theory

This paper presents a decision-making framework based on an integrated artificial reasoning framework and Markov decision process (MDP). The integrated artificial reasoning framework provides a physics-based approach that converts system information into state transition models, and the analysis result will be represented by the transition probabilities that can be used with an MDP to find a traceable and explainable optimal pathway. A dynamic Bayesian network (DBN) is well suited for representing the structure of an MDP. The causality information among process variables (or among subsystems) is mathematically represented in a DBN by the conditional probabilities of the node’s states provided different probabilities of the parent node’s states. To define node states in a physically understandable manner, we used multilevel flow modeling (MFM). An MFM follows the fundamental energy and mass conservation laws and supports the selection of process variables that represent the system of interest so that causal relations among process variables are properly captured. An MFM-based DBN supports developing state transition models in an MDP to capture the effect of process variables of system having physical relations. The operators of the target system can capture stochastic system dynamics as multiple subsystem state transitions based on their physical relations and uncertainties coming from component degradation or random failures. We analyzed a simplified exemplary system to illustrate an optimal operational policy using the suggested approach.

Markov decision process↗

Bridging Equipment Reliability Data and Risk Informed Decisions in a Plant Operation Context

Industry equipment reliability and asset management programs are essential elements that help ensure the safe and economical operation of nuclear power plants. The effectiveness of these programs is addressed in several industry-developed and regulatory programs. The Risk-Informed Asset Management (RIAM) project is tasked to develop tools in support of the equipment reliability and asset management programs at nuclear power plants. These tools are designed to create a direct bridge between component health/lifecycle data and decision making (e.g., maintenance scheduling and project prioritization). The goal of this article is to provide a guide for specific use cases that the RIAM project is targeting. We have grouped uses cases into three main areas. The first area focuses on the analysis of equipment reliability data with a particular emphasis on condition-based data, such as test/surveillance reports and component monitoring data. The second area focuses on the integration of equipment reliability into system/plant reliability models to determine system/plant health and identify the components that are critical to maintain an operational system. Lastly, the third area manages plant resources, such as maintenance activities and replacement scheduling using optimization methods. Here the primary focus is on supporting typical system engineer decisions regarding maintenance activity scheduling and component aging management. This is performed in a risk-informed context where the term “risk” is broadly constructed to include both plant reliability and economics. This framework combines data analytics tools to analyze equipment reliability data with risk-informed methods designed to support system engineer decisions (e.g., maintenance and replacement schedules, optimal maintenance posture) in a customizable workflow.

97 - MATHEMATICS AND COMPUTING↗

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Regional Energy Deployment System (ReEDS) Model Documentation: 2025

The Regional Energy Deployment System (ReEDS) model is a capacity expansion and dispatch model that is primarily used for the contiguous U.S. electric power sector. The model relies on system-wide least cost optimization to estimate the type and location of future generation and transmission capacity. This document describes details of how the model is formulated, how it functions, and many of the key inputs.

15 GEOTHERMAL ENERGY↗

Prompt Phrase Ordering Using Large Language Models in HPC: Evaluating Prompt Sensitivity

Large language models (LLMs) have demonstrated effective performance in domain-specific tasks, often requiring a well-designed prompt to guide their responses. However, optimizing the right prompt is challenging due to prompt sensitivity—the phenomenon where small changes in the prompt can lead to significant variations in performance. In this study, we evaluate prompt performance by examining all permutations of independent phrases to investigate prompt sensitivity and robustness. We used two datasets: the GSM8k dataset, which assesses mathematical reasoning, and a custom template prompt for summarizing database metadata. Our goal was to evaluate the performance across all permutations of a sequence of prompt phrases. The study was conducted using the llama3-instruct- 7B model hosted on Ollama, with computations parallelized in a high-performance computing environment. By comparing the average index of phrases in the best and worst-performing prompts, we found that the order of independent phrases within a prompt significantly impacts LLM performance. Additionally, we used Hamming distance to assess changes between phrase orderings, concluding that prompt modifications can dramatically affect scores, often by almost random chance. These findings support existing research on prompt sensitivity. We discuss the challenges of prompt optimization, noting that altering phrases in a successful prompt does not always result in another successful prompt.

97 MATHEMATICS AND COMPUTING↗

Analyzing School Bus Electrification in Richmond, Virginia

School buses are an essential component of the transportation infrastructure, serving as a lifeline for students across the globe. However, the widespread use of diesel school buses has raised concerns about the health impact on millions of students exposed to harmful emissions daily. Recognizing this issue, school districts worldwide are urgently seeking cleaner energy alternatives. Electric school buses emerge as an environmentally friendly and sustainable option, fostering a healthier environment for both students and communities. However, school bus electrification faces the challenges of high upfront cost, cumbersome charging management, and constraints from power grids. To help school bus operators address those challenges, this study presents a data-driven analysis for school bus electrification. This study considered a real-world school bus system in Richmond, VA, and developed a mathematical programming model to analyze the system design, charging strategies, and charging load profiles for the electrification scenario. The study evaluated different charging strategies based on model outcomes, aiming to optimize efficiency and effectiveness. Ultimately, this research generated electric school bus charging demand profiles under various scenarios, shedding light on the feasibility and implications of transitioning to electric-powered school buses.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A framework and tool for designing cost-effective, resilient, and circular net-zero supply chains under uncertainty with an application to multilayer plastic films

While 55% of Fortune 500 companies have committed to achieving net-zero emissions and/or zero-waste operations by 2035, only 2% are currently on track, revealing a critical gap between ambition and action. Designing supply chains that reduce both emissions and waste is a complex non-intuitive, multi-objective challenge, compounded by the high costs of new technologies and the need for resilient, profitable solutions. This paper aims to address this challenge by presenting a generic framework and multi-objective optimization formulation for designing cost-effective, circular, and resilient supply chains under uncertainty, implemented through a user-friendly decision-support tool with intuitive data visualization capabilities, enabling communication of results to both technical and non-technical stakeholders. We demonstrate the application of this framework in the context of multilayer plastic films (barrier films), which are widely used in food packaging and composite materials. The model quantifies trade-offs across three objectives: minimizing global warming potential, maximizing circularity, and minimizing cost. A key contribution of this work is the explicit modeling of technological resilience, the ability of supply chains to maintain function under disruption. In the cost-minimization case, the resilience constraint makes the design approximately three times more expensive in the short-term metric, but shifts the system from relying on a single recovery pathway to a portfolio of four recovery pathways, improving the robustness of the optimization solution under uncertainty. Lastly, we introduce TranZero, a decision-support tool that integrates material flow analysis, hotspot identification, and optimization-based scenario planning to support net-zero and circularity decisions.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Economic NMPC for a Reversible Solid Oxide Cell

Reversible solid oxide fuel cells (rSOCs) offer the flexibility to operate in tandem with the electric grid by switching between fuel cell and electrolysis modes based on real-time electricity prices. However, their complex, tightly coupled dynamic behavior poses significant challenges in determining optimal operating strategies. In this work, we present an economic nonlinear model predictive control (E-NMPC) framework to optimize the operation of rSOCs. The proposed E-NMPC is applied to a detailed rSOC flowsheet model that includes a utility scale rSOC module as well as balance-of-plant equipment necessary for thermal management. Our results demonstrate that in fuel cell mode, the E-NMPC strategy reduces hydrogen consumption compared to conventional set-point tracking NMPC, while maintaining the same level of electricity output. Also, in electrolysis mode, the E-NMPC yields a marginal improvement in hydrogen production. In addition, we explore the integration of a battery with the rSOC system to enhance flexibility in meeting electricity production and consumption targets.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Deep Reinforcement Learning for Distribution System Operations: A Tutorial and Survey

Here, the rapid evolution of modern electric power distribution systems into complex networks of interconnected active devices, distributed generation (DG), and storage poses increasing difficulties for system operators. The large-scale integration of distributed energy resources (DERs) and the rapid exchange of measurement data via communication networks present major opportunities for advancing grid operations but also introduce greater uncertainty, higher data dimensionality, more complex network and device models, and challenging control and optimization problems. Deep reinforcement learning (DRL) algorithms are promising in addressing these challenges. However, they have not been effectively adapted for power systems applications, requiring extensive customization for implementation and evaluation. This has resulted in reproducibility challenges and a steep learning curve for researchers new to applying DRL algorithms to the power systems domain. To bridge these gaps, this tutorial aims to serve as a valuable resource for researchers interested in exploring learning-based algorithms to operate active power distribution networks. Specifically, this work presents a generalized process for translating sequential decision-making problems in power distribution systems into Markov decision process (MDP) formulations, illustrated through concrete grid service examples. Additionally, we introduce a simple environment design strategy to develop and evaluate example DRL algorithms for distribution system applications, complete with an included code repository to guide users through environment construction.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Demand Bidding Model for Multi-Product Industrial Plants

The growing contribution of renewable energy sources has increased volatility and uncertainty in electricity markets, challenging traditional grid operation paradigms. Demand bidding (DB), a market participation model where (large) electricity users communicate their willingness to pay for electricity to the grid operator, was shown in previous work to enhance grid stability and lower generation cost. We present a DB model for multi-product industrial plants, based on an extended optimal power flow problem where the plant dynamics are represented using autoregressive with extra inputs (ARX) models. We compare DB to price-based demand-side management, showing that, under certain assumptions, the two approaches are equivalent, while DB provides more transparency and predictability to the grid operator. A case study based on an industrial air separation unit is discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗