SEARCH · Search NASA

Results for “Constraint 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2025

On optimal control of hybrid dynamical systems using complementarity constraints

Optimal control for switch-based dynamical systems is a challenging problem in the process control literature. In this study, we model these systems as hybrid dynamical systems with finite number of unknown switching points and reformulate them using non-smooth and non-convex complementarity constraints as a mathematical program with complementarity constraints (MPCC). We utilize a moving finite element based strategy to discretize the differential equation system to accurately locate the unknown switching points at the finite element boundary and achieve high-order accuracy at intermediate non-collocation points. We propose a globalization approach to solve the discretized MPCC problem using a mixed NLP/MILP-based strategy to converge to a non-spurious first-order optimal solution. The method is tested on three dynamic optimization examples, including a gas–liquid tank model and an optimal control problem with a sliding mode solution.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗

DOE OSTI2025

Phlex: Parallel, Hierarchical, and Layered EXecution of data-processing algorithms

Phlex is a computing framework supporting the parallel, hierarchical, and layered execution of data-processing algorithms. It is based on the functional-programming paradigm, thus guaranteeing thread-safety when invoking user-defined pure functions. Phlex allows users to specify arbitrary graph-based hierarchies of data organization, enabling more flexible processing of data as required by the constraints of the program.

Knoepfel, KyleJ. [Fermi National Accelerator Labor↗

DOE OSTI2025

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter $\eta _k$ . The resulting AL subproblems are $\eta _k$ -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $\epsilon _k$ (for inexact subproblem resolution), the penalty parameter $\rho _k$ , and smoothing parameter $\eta _k$ at epoch k, we derive rate and complexity guarantees of $\tilde{\mathcal {O}}(1/{\varepsilon }^{3/2})$ and $\tilde{\mathcal {O}}(1/{\varepsilon })$ in convex and strongly convex regimes for computing an ${\varepsilon }$ -optimal solution, when $\rho _k$ increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with $\rho _k = \rho$ as well as $\eta _k = \eta$ . Preliminary numerics on a fused Lasso problem display promise.

augmented Lagrangian↗

DOE OSTI2025

Applications of the Landau bootstrap

We advocate a strategy of bootstrapping Feynman integrals from just knowledge of their singular behavior. This approach is complementary to other bootstrap programs, which exploit nonperturbative constraints such as unitarity, or amplitude-level constraints such as gauge invariance. We begin by studying where a Feynman integral can become singular, and the behavior it exhibits near these singularities. We then characterize the space of functions that we expect the integral to evaluate to, in order to formulate an appropriate ansatz. Finally, we derive constraints on where each singularity can appear in this ansatz, and use information about the expansion of the integral around singular points in order to determine the value of all remaining free coefficients. Throughout, we highlight how constraints that have previously only been derived for integrals with generic masses can be extended to integrals involving particles of equal or vanishing mass. We illustrate the effectiveness of this approach by bootstrapping a number of examples, including the four-point double box with a massive internal loop. Published by the American Physical Society 2025

Hannesdottir, Holmfridur S. (ORCID:000000025440208↗

DOE OSTI2025

Demonstration of a Novel Technology to Manage Electricity Demand in Grid-Independent Military Microgrids

This research was conducted by the National Renewable Energy Laboratory (NREL) in collaboration with the S&C Electric Inc. through funding provided by the ESTCP. The project demonstrates use of cybersecure Automated Demand Response (ADR) technology to effectively manage microgrid loads during grid-independent, also known as "islanded," operation. When military microgrids become isolated from the main electrical grid, they are required to balance electricity supply and demand locally. Given that local generation may be constrained, the prevailing strategy involves shedding all but the most critical loads by tripping smart circuit breakers, which then necessitate manual resetting. This approach is generally implemented at the building level, which means that the buildings with mission-critical activities are exempt from load management and remain fully powered, whereas those deemed non-critical can experience a complete loss of service. In this research we developed a method that allows building automation systems to selectively control their assets in response to load shedding request from a microgrid controller, avoiding total loss of service in contrast to the conventional control approach. A commercial OpenADR client server by GridFabric is used for communication between the microgrid controller and the building management system (BMS). The microgrid controller monitors both generation capacity and various assets within the microgrid and issues a demand reduction request when necessary. This request is communicated to the OpenADR server via Modbus. Upon receiving the request, the OpenADR server forwards it to the BMS utilizing the OpenADR protocol. The BMS is pre-configured with various levels of load reduction strategies based on the controllable assets available, allowing for a nuanced approach to demand reduction. Both lab and field tests were performed that considered load shedding needed to achieve closed transition into island mode and to accommodate changing loads and power source availability while islanded. A commercial microgrid controller was used for these tests with normal programming within the expected constraints of the system capabilities. That is, the solution did not require any specialized modification to the code base of the controller. Given the latency of the round-trip communication path between the microgrid controller and the various devices involved with the load shed processes, there are certain scenarios for which the demonstrated solution are appropriate and some which are not. The methods described in this report can be used for load shedding/restoration during transitions between islanded and grid-tied modes of operation, as well as accommodating normal variations in load and the need to remove a power source from operation for maintenance. These methods should not be used for scenarios that require load shedding within a second or two such as sudden and unanticipated significant load increases or loss of power sources through equipment faults.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2024

Static actuator-sharing algorithm for concurrent control of multiple plasma properties

Simultaneous regulation of multiple properties in next-generation tokamaks like ITER and fusion pilot plant may require the integration of different plasma control algorithms. Such integration requires the conversion of individual controller commands into physical actuator requests while accounting for the coupling between different plasma properties. This work proposes a tokamak and scenario-agnostic actuator-sharing algorithm (ASA) to perform the above-mentioned command-request conversion and, hence, integrate multiple plasma controllers. The proposed algorithm implicitly solves a quadratic programming (QP) problem formulated to account for the saturation limits and the relation between the controller commands and physical actuator requests. Since the constraints arising in the QP program are linear, the proposed ASA is highly computationally efficient and can be implemented in the tokamak plasma control system in real time. Furthermore, the proposed algorithm is designed to handle real-time changes in the control objectives and actuators’ availability. Nonlinear simulations carried out using the Control Oriented Transport SIMulator illustrate the effectiveness of the proposed algorithm in achieving multiple control objectives simultaneously.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Recovery Simulator and Analysis Formulation: Mathematical Framework for Enhanced Resilience and Resource Allocation

This report introduces recovery simulator and analysis (RSA), a framework aimed at enhancing the resilience of electrical grids post-disruption. The RSA model leverages an optimization problem formulation that focuses on maximizing the load served (or optionally customers served) through a coordinated and cooptimized recovery of non-black start generation, transmission lines, feeders and substations subject to labor budget constraints. By integrating advanced linear programming techniques, the simulator selects efficient reocovery pathways, optimizing both short-term and long-term grid recovery strategies. The mathematical framework guides decision-making through a comprehensive evaluation of potential recovery actions, factoring in the trade-offs between labor constraints and load (or optionally customer) restoration efficacy. This enables grid operators to simulate diverse outage scenarios and delineate optimal recovery pathways, thereby prioritizing critical repair tasks and ensuring resource allocation is both economical and effective. The intended use case of RSA is to allow planners to explore many recovery scenarios quickly and determine assets most critical across a wide range of scenarios, and therefore strong candidates for hardening or additional investment. RSA might also be used in an operational setting, following a single event, for exploring efficient recovery pathways.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2024

The dark energy survey supernova program: investigating beyond-ΛCDM

We report constraints on a variety of non-standard cosmological models using the full 5-yr photometrically classified type Ia supernova sample from the Dark Energy Survey (DES-SN5YR). Both Akaike Information Criterion (AIC) and Suspiciousness calculations find no strong evidence for or against any of the non-standard models we explore. When combined with external probes, the AIC and Suspiciousness agree that 11 of the 15 models are moderately preferred over Flat-|$\Lambda$|CDM suggesting additional flexibility in our cosmological models may be required beyond the cosmological constant. We also provide a detailed discussion of all cosmological assumptions that appear in the DES supernova cosmology analyses, evaluate their impact, and provide guidance on using the DES Hubble diagram to test non-standard models. An approximate cosmological model, used to perform bias corrections to the data holds the biggest potential for harbouring cosmological assumptions. We show that even if the approximate cosmological model is constructed with a matter density shifted by |$\Delta \Omega _{\rm m}\sim 0.2$| from the true matter density of a simulated data set the bias that arises is subdominant to statistical uncertainties. Nevertheless, we present and validate a methodology to reduce this bias.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Perspectives on Systematic Cloud Microphysics Scheme Development With Machine Learning

Cloud microphysics—the collection of processes that govern the small‐scale formation, evolution, and interactions of liquid droplets and ice crystals in clouds and precipitation—remains a major source of uncertainty in weather and climate models. Although too small in scale to be explicitly resolved in any large‐eddy simulation, weather, or climate model, the representation of cloud microphysical processes has significant impact at the climate scale. Current microphysical schemes are limited by both parametric uncertainty, linked to uncertainty in physical parameter values, and structural uncertainty, arising from incomplete physical understanding of the processes at play or approximations made for computational efficiency. Recent advances in the application of machine learning (ML) to the physical sciences show significant potential for minimizing these limitations by leveraging high‐fidelity simulations and observations. Here we outline the challenges that must be addressed to apply ML toward cloud microphysics scheme development. This perspectives paper synthesizes recent progress in using data‐driven methods, including ML, to improve cloud microphysics parameterizations and highlights opportunities to address key uncertainties. We discuss the roles of aleatoric (irreducible, or statistical) and epistemic (reducible, or systematic) errors in contributing to microphysics parameterization uncertainty. ML can leverage observations to improve microphysical schemes via bottom‐up and top‐down constraints. Methods such as differentiable programming and ML‐enhanced sampling strategies and the creation of large scale benchmark data sets promise to bridge the gap between observations and models and to improve the consistency of cloud microphysical representation across temporal and spatial scales.

Lamb, Kara D. [Columbia Univ., New York, NY (Unite↗

DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Demand response event simulator and risk-aware bidding tool for industrial customers

Incentive Based Demand Response (IBDR) program participation delivers financial benefits to the consumers and resiliency benefits to the electricity grid. Effectively participating in these programs as an industrial consumer requires bidding strategies that balance financial risk with operational constraints. Existing bidding tools tend not to fully incorporate stochastic IBDR event modeling, program specific baseline and payment/penalty calculations, or demand reduction process control schemes that account for the cascading impacts of shutdown in complex facilities. Here, this work presents an IBDR event simulator and risk-aware bidding framework tool integrating three key components: a flexible, parameterized demand response event generator that rigorously accounts for program structures and stochasticity, a demand response operational simulation model that generates explicit control strategies for load reduction, and a Monte Carlo simulator to evaluate financial risk for varied capacity bids. A case study at a wastewater treatment plant participating in PG&E's Capacity Bidding Program demonstrates the framework's utility. In the peak capacity price month of August, optimal bidding by the wastewater treatment plant nets a mean IBDR benefit of $101,000 (67% of the August electricity bill) with 0.4% probability of a financial loss. This framework enables industrial operators to make informed bidding decisions, negotiate better program terms with demand response load aggregators, and analyze energy flexibility investments at their facilities. Ultimately, this work reduces participation barriers in IBDR programs and supports the broader goal of enhancing grid reliability and renewable energy integration.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2025

Improving Resiliency in Planning MW-Scale Medium and Heavy Duty EV Charging Stations Considering TSCOTS Optimization

Electrification of heavy-duty (HD) vehicles marks an important milestone and technical challenge in the electric vehicle (EV) industry and the public grid. However, implementing EV charging at this scale will necessitate that traditional truck stops be updated with EV charging infrastructure that could represent 10's of MW in electricity consumption. Furthermore, as the transportation sector is represented as critical infrastructure, supporting resiliency considerations in EV charging infrastructure will be critical. This paper proposes an optimization-based approach for optimally designing a MW-scale microgrid charging network. This approach transforms conventional designed truck stops into a reliable HDEV charging stations capable of overnight slow charging and 30-minute to 1 hour fast charging. Using a mixed-integer linear program formulation blending capacity planning and reliability constraints, an optimal network configuration can be solved for a proposed EV charging station that includes photovoltaic and battery energy storage capabilities.

Ponce, Moises [University of Tennessee, Knoxville ↗

DOE OSTI2024

Grid-Aware Charging and Operational Optimization for Mixed-Fleet Public Transit

The rapid growth of urban populations and the increasing need for sustainable transportation solutions have prompted a shift towards electric buses in public transit systems. However, the effective management of mixed fleets consisting of both electric and diesel buses poses significant operational challenges. One major challenge is coping with dynamic electricity pricing, where charging costs vary throughout the day. Transit agencies must optimize charging assignments in response to such dynamism while accounting for secondary considerations such as seating constraints. This paper presents a comprehensive mixed-integer linear programming (MILP) model to address these challenges by jointly optimizing charging schedules and trip assignments for mixed (electric and diesel bus) fleets while considering factors such as dynamic electricity pricing, vehicle capacity, and route constraints. We address the potential computational intractability of the MILP formulation, which can arise even with relatively small fleets, by employing a hierarchical approach tailored to the fleet composition. By using real-world data from the city of Chattanooga, Tennessee, USA, we show that our approach can result in significant savings in the operating costs of the mixed transit fleets.

Sen, Rishav↗

DOE OSTI2024

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2026

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗

DOE OSTI2026

Distribution System Congestion Management - A Survey of Reliable Integration for Aggregated Resources and Microgrids

Rising penetration of consumer-owned Distribution Grid Resources (DGRs), increasingly managed by third party aggregators and enrolled in grid services and wholesale market programs, can create localized congestion in distribution networks. Managing these constraints is challenging due to a persistent coordination and information gap: utilities are accountable for reliability and have network topology and state visibility, while aggregators control the DGR capability needed to relieve congestion. This survey synthesizes congestion management solutions for distribution systems with high DGR penetration, covering both market-based mechanisms (distribution level markets, locational pricing, flexibility auctions) and non-market-based solutions (network reconfiguration, direct DGR control, demand response, curtailment, etc.). The literature is organized across three decision horizons: long term planning, operational planning, and real-time operation. Special attention is devoted to emerging distribution system operator architectures and coordination frameworks spanning transmission system operators, aggregators, and microgrids. Drawing on recent case studies and implementations, we distill best practices, identify key technical and economic barriers, and outline research directions. The evidence points to a shift toward integrated congestion management that combines market signals with technical controls, enabled by improved monitoring, forecasting, and closed loop control capabilities.

Active Distribution Networks (ADN)↗

DOE OSTI2025

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗