Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear programming problem”

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 271 records · Page 15

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗

A novel matching formulation for startup costs in unit commitment

Here we present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.

97 MATHEMATICS AND COMPUTING↗

Trading strategies for distribution company with stochastic distributed energy resources

This paper proposes a methodology to address the trading strategies of a proactive distribution company (PDISCO) engaged in the transmission-level (TL) markets. A one-leader multi-follower bilevel model is presented to formulate the gaming framework between the PDISCO and markets. The lower-level (LL) problems include the TL day-ahead market and scenario-based real-time markets, respectively with the objectives of maximizing social welfare and minimizing operation cost. The upper-level (UL) problem is to maximize the PDISCO’s profit across these markets. The PDISCO’s strategic offers/bids interactively influence the outcomes of each market. Since the LL problems are linear and convex, while the UL problem is non-linear and non-convex, an equivalent primal–dual approach is used to reformulate this bilevel model to a solvable mathematical program with equilibrium constraints (MPEC). The effectiveness of the proposed model is verified by case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A Novel Matching Formulation for Startup Costs in Unit Commitment

We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening reduces the computational burden in comparison to existing formulations, especially for UC instances with large variability in net-load due to renewables production.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Joint Optimization of Multimodal Transit Frequency and Shared Autonomous Vehicle Fleet Size with Hybrid Metaheuristic and Nonlinear Programming

Shared autonomous vehicles (SAVs) bring competition to traditional transit services but redesigning multimodal transit network can utilize SAVs as feeders to enhance service efficiency and coverage. This paper presents an optimization framework for the joint multimodal transit frequency and SAV fleet size problem, a variant of the transit network frequency setting problem. The objective is to maximize total transit ridership (including SAV-fed trips and subtracting boarding rejections) across multiple time periods under budget constraints, considering endogenous mode choice (transit, point-to-point SAVs, driving) and route selection, while allowing for strategic route removal by setting frequencies to zero. Due to the problem’s non-linear, non-convex nature and the computational challenges of large-scale networks, we develop a hybrid solution approach that combines a metaheuristic approach (particle swarm optimization) with nonlinear programming for local solution refinement. To ensure computational tractability, the framework integrates analytical approximation models for SAV waiting times based on fleet utilization, multimodal network assignment for route choice, and multinomial logit mode choice behavior, bypassing the need for computationally intensive simulations within the main optimization loop. Applied to the Chicago metropolitan area’s multimodal network, our method illustrates a 33.3% increase in transit ridership through optimized transit route frequencies and SAV integration, particularly enhancing off-peak service accessibility and strategically reallocating resources.

Ng, Max↗

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗

Optimal Wind Power Uncertainty Intervals for Electricity Market Operation

It is important to select an appropriate uncertainty level of the wind power forecast for power system scheduling and electricity market operation. Traditional methods hedge against a predefined level of wind power uncertainty, such as a specific confidence interval or uncertainty set, which leaves the questions of how to best select the appropriate uncertainty levels. To bridge this gap, this paper proposes a model to optimize the forecast uncertainty intervals of wind power for power system scheduling problems, with the aim of achieving the best trade-off between economics and reliability. Then we reformulate and linearize the models into a mixed integer linear programming (MILP) without strong assumptions on the shape of the probability distribution. In order to invest the impacts on cost, reliability, and prices in a electricity market, we apply the proposed model on a twosettlement electricity market based on a six-bus test system and on a power system representing the U.S. state of Illinois. The results show that the proposed method can not only help to balance the economics and reliability of the power system scheduling, but also help to stabilize the energy prices in electricity market operation.

electricity market↗

Optimal assignment for the single-household shared autonomous vehicle problem

Autonomous vehicles have the potential to transform the way people are transported. While driverless technology may mean fewer vehicles are required to transport people to and from their daily activities, such changes may result in increased congestion or total miles traveled. In this study, we solve the single-household shared autonomous vehicle problem to identify cost-optimal routings of vehicles throughout the day. Such a tool will be useful for consumers seeking to minimize cost and for regulators seeking to understand and predict how people may behave in different scenarios. Here, we provide a thorough literature review and construct a mixed-integer linear program to minimize the daily travel cost of a household attending a given set of activities. Since solution time is a determinant for applicability of such a model, we present the model in a component-wise fashion. This approach allows us to understand which features most affect the problem complexity and solution time. We note that modeling carpooling is the feature that most increases time to find an optimal solution, and we therefore propose a novel modeling technique for carpooling two people. We illustrate the performance of our model by comparing it with other models from the literature and note that our model can solve significantly larger problem instances and in a time that is short enough to facilitate real-time scheduling. We also highlight the utility of our model for regulators, who can use it to analyze quickly produced optimal routes under different cost/tax scenarios.

33 ADVANCED PROPULSION SYSTEMS↗

Optimal Heliostat Assignment Strategy for Multiple-Receiver Systems

Next-generation concentrating solar power concepts currently being developed under the U.S. Department of Energy's Gen3 program include several novel heliostat field and receiver arrangements. Among these concepts are solar fields utilizing multiple receivers or several distinct receiver flux control zones, and each of which has particular power or peak flux constraints. In this paper, we present a linear program that identifies optimal heliostat-to-receiver assignment strategies for multi-receiver or multi-zone solar fields based on detailed calculations made by an optics modeling package. Two distinct problems are addressed: namely, (1) a design problem that chooses the optimal set of heliostats to include in a final layout given receiver constraints and performance, and (2) an operations problem that assigns existing heliostats to a receiver, maximizing field power output while maintaining receiver power constraints. The optimization methodology is integrated into the concentrating solar power tower modeling package SolarPILOTTM, and results are presented showing that heliostat assignment strategies can impact both initial heliostat field layout characteristics and the cost of thermal energy produced by the field. The methodology succeeds in maintaining power requirements but at the expense of producing different flux profiles on each receiver surface. Consequently, the paper also discusses additional measures that are applied to ensure that desirable flux distribution properties are maintained, reducing local flux mean-absolute-deviation values from a baseline of 17% or greater to less than 5% compared to a desired reference flux profile.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Modeling and Integration of Flexible Demand in Heat and Electricity Integrated Energy System

This paper is focused on utilizing customers' flexible energy demand, including both heat demand and electricity demand, to provide balancing resources and relieve the difficulties of integrating variable wind power with the combined heat and power. The integration of heat and electricity energy systems providing customers with multiple options for fulfilling their energy demand is described. Customer aggregators are introduced to supply downstream demand in the most economical way. Controlling customers' energy consumption behaviors enables aggregators to adjust their energy demand in response to supply conditions. Incorporating aggregators' flexible energy demand into the centralized energy dispatch model, a two-level optimization problem (TLOP) is first formed where the system operatormaximizes social welfare subject to aggregators' strategies, which minimize the energy purchase cost. Furthermore, the subproblems are linearized based on several reasonable assumptions. Optimal conditions of the subproblems are then transformed as energy demands to be described as explicit piecewise-linear functions of electricity prices corresponding to the demand bid curves. In this way, the TLOP is transformed to a standard optimization problem, which requires aggregators to only submit a demand bid to run the centralized energy dispatch program. All the parameters pertaining to the aggregators' energy consumption models are internalized in the bid curves. The proposed technique is illustrated in a modified testing system.

combined heat and power (CHP)↗

Near-Optimal Performance of Stochastic Model Predictive Control

Here, this article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative uncertainties. Under a finite support assumption, the problem can be cast as a finite-dimensional quadratic program, but the problem becomes quickly intractable as the problem size grows exponentially in the horizon length. SMPC aims to compute approximate solutions by solving a sequence of problems with truncated prediction horizons and committing the solution in a receding-horizon fashion. Although this approach is widely used in practice, its performance relative to the optimal solution is not well understood. This article reports for the first time a rigorous near-optimal performance guarantee of SMPC: under stabilizability and detectability conditions, the regret of SMPC is exponentially small in the prediction horizon length, allowing SMPC to achieve near-optimal performance at a substantially reduced computational expense.

93E20, 93B45↗

Fusion Simulation Program Execution Plan

The overall science goal of the FSP is to develop predictive simulation capability for magnetically confined fusion plasmas at an unprecedented level of integration and fidelity. This will directly support and enable effective U.S. participation in research related to the International Thermonuclear Experimental Reactor (ITER) and the overall mission of delivering practical fusion energy. The FSP will address a rich set of scientific issues together with experimental programs, producing validated integrated physics results. This is very well aligned with the mission of the ITER Organization to coordinate with its members the integrated modeling and control of fusion plasmas, including benchmarking and validation activities. Initial FSP research will focus on two critical areas: 1) the plasma edge and 2) whole device modeling including disruption avoidance. The first of these problems involves the narrow plasma boundary layer and its complex interactions with the plasma core and the surrounding material wall. The second requires development of a computationally tractable, but comprehensive model that describes all equilibrium and dynamic processes at a sufficient level of detail to provide useful prediction of the temporal evolution of fusion plasma experiments. The initial driver for the whole device model (WDM) will be prediction and avoidance of discharge-terminating disruptions, especially at high performance, which are a critical impediment to successful operation of machines like ITER. If disruptions prove unable to be avoided, their associated dynamics and effects will be addressed in the next phase of the FSP. The FSP plan targets the needed modeling capabilities by developing Integrated Science Applications (ISAs) specific to their needs. The Pedestal-Boundary model will include boundary magnetic topology, cross-field transport of multi-species plasmas, parallel plasma transport, neutral transport, atomic physics and interactions with the plasma wall. It will address the origins and structure of the plasma electric field, rotation, the L-H transition, and the wide variety of pedestal relaxation mechanisms. The Whole Device Model will predict the entire discharge evolution given external actuators (i.e., magnets, power supplies, heating, current drive and fueling systems) and control strategies. Based on components operating over a range of physics fidelity, the WDM will model the plasma equilibrium, plasma sources, profile evolution, linear stability and nonlinear evolution toward a disruption (but not the full disruption dynamics). The plan assumes that, as the FSP matures and demonstrates success, the program will evolve and grow, enabling additional science problems to be addressed. The next set of integration opportunities could include: 1) Simulation of disruption dynamics and their effects; 2) Prediction of core profile including 3D effects, mesoscale dynamics and integration with the edge plasma; 3) Computation of non-thermal particle distributions, self-consistent with fusion, radio frequency (RF) and neutral beam injection (NBI) sources, magnetohydrodynamics (MHD) and short-wavelength turbulence.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Bi-Level Linear Programming Model for Automatic Load Shedding: A Distributed Wide-Area Measurement System-based Solution

Load shedding is currently implemented as a two-step based approach. In the first step, manual load shedding is taken place, were system operators, using estimates, inform distribution utilities of predicted stressful conditions. Information provided include the potential use of energy reserves, as well as load shedding amount. In a second step, automatic load shedding is done. The latter is realized using protection relays. While considering frequency variation, pre-defined values of load to be shed and correspondent number of stages for such to be realized are transformed into relay settings. Under-frequency protection relays use only local measurements towards decision making, thus operate in a decentralized architecture. Decision making is done in milliseconds plus breaker time. While this approach has provided much system reliability, considering the new smart grid paradigm, where system dynamics are much faster due to increasing renewable resources penetration, in some operating conditions it will generate sub-optimal solutions, such as islanding. Phasor measurement units provide a source of information which can be useful for this problem. Centralized architecture-based solutions for automatic load shedding, as present in the state-of-the-art, require though total processing times which are not acceptable for real-life implementation. In this work, considering the above, a bi-level linear programming model is presented. The model is implemented considering a distributed architecture while leveraging phasor measurement units data. The upper-level model estimates the current system state. Results of this model are embedded in a lower-level model, which decision variables are the location and load value to be shed. Easy-to-implement model, built-on the classic weighted least squares solution, highlight potential aspects towards real-life applications.

Bretas, Arturo Suman↗

An interval-parameter stochastic robust optimization model for supporting municipal solid waste management under uncertainty

A stochastic robust interval linear programming model (IPRO) was developed for supporting municipal solid waste management under uncertainty. The model improves upon the existing stochastic robust optimization (SRO) and interval linear programming (ILP) methods by allowing evaluations of trade-offs among expected costs, cost variability, and risk of violating relax constraints simultaneously, as well as reflections of complex uncertainties through both interval and stochastic theories. A long-term waste management problem was used to demonstrate the applicability of IPRO model. The results indicated that IPRO normally led to interval solutions, where waste-management alternatives could be generated by adjusting the decision-variable values within their intervals. The model could also help waste managers to identify desired policies that under various environmental, economic, system-feasibility and system-reliability constraints.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A Scalable Approach to Minimize Charging Costs for Electric Bus Fleets

Incorporating battery electric buses into bus fleets faces three primary challenges: a BEB’s extended refuel time, the cost of charging, both by the consumer and the power provider, and large compute demands for planning methods. When BEBs charge, the additional demands on the grid may exceed hardware limitations, so power providers divide a consumer’s energy needs into separate meters even though doing so is expensive for both power providers and consumers. Prior work has developed a number of strategies for computing charge schedules for bus fleets; however, prior work has not worked to reduce costs by aggregating meters. Additionally, because many works use mixed integer linear programs, their compute needs make planning for commercial-sized bus fleets intractable. This work presents a multi-program approach to computing charge plans for electric bus fleets. The proposed method solves a series of subproblems where the solution to the charge problem becomes more refined with each problem, moving closer to the optimal schedule. The results demonstrate how runtimes are reduced by using intermediate subproblems to refine the bus charge solution so that the proposed method can be applied to large bus fleets of 100+ buses. Not only will we demonstrate that runtimes scale linearly with the number of buses but we will also show how the proposed method scales to large bus fleets of over 100 buses while managing the monthly cost of energy.

Mortensen, Daniel (ORCID:0000000276494452)↗

A computational study of the use of an optimization-based method for simulating large multibody systems.

The present work aims at comparing the performance of several quadratic programming (QP) solvers for simulating large-scale frictional rigid-body systems. Traditional time-stepping schemes for simulation of multibody systems are formulated as linear complementarity problems (LCPs) with copositive matrices. Such LCPs are generally solved by means of Lemke-type algorithms and solvers such as the PATH solver proved to be robust. However, for large systems, the PATH solver or any other pivotal algorithm becomes unpractical from a computational point of view. The convex relaxation proposed by one of the authors allows the formulation of the integration step as a QPD, for which a wide variety of state-of-the-art solvers are available. In what follows we report the results obtained solving that subproblem when using the QP solvers MOSEK, OOQP, TRON, and BLMVM. OOQP is presented with both the symmetric indefinite solver MA27 and our Cholesky reformulation using the CHOLMOD package. We investigate computational performance and address the correctness of the results from a modeling point of view. We conclude that the OOQP solver, particularly with the CHOLMOD linear algebra solver, has predictable performance and memory use patterns and is far more competitive for these problems than are the other solvers.

97 MATHEMATICS AND COMPUTING↗

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↗

Koopman Model Predictive Control for Eco-Driving of Automated Vehicles

In this paper, we develop a data-driven process for building a model predictive control (MPC) for eco-driving of automated vehicles. The process involves performing system identification in which the non-linear vehicle dynamics model is approximated by the Koopman operator, a linear predictor of higher state-dimension, in a data-driven framework. This approach allows us to formulate the eco-driving problem in a constrained quadratic program that leads to a computationally fast MPC. The MPC is then implemented as a closed-loop control of an electric vehicle in numerical simulations for demonstration.

autonomous vehicle↗