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 307 records · Page 17

Programming the gradient projection algorithm

The gradient projection method of numerical optimization which is applied to problems having linear constraints but nonlinear objective functions is described and analyzed. The algorithm is found to be efficient and thorough for small systems, but requires the addition of auxiliary methods and programming for large scale systems with severe nonlinearities. In order to verify the theoretical results a digital computer is used to simulate the algorithm.

Hargrove, A.↗

A k-permutation algorithm for Fixed Satellite Service orbital allotments

A satellite system synthesis problem, the satellite location problem (SLP), is addressed in this paper. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the Fixed Satellite Service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: (1) the problem of ordering the satellites and (2) the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, that has been developed to find solutions to SLPs formulated in the manner suggested is described. Solutions to small example problems are presented and analyzed.

Reilly, Charles H.↗

The role of service areas in the optimization of FSS orbital and frequency assignments

An implicit relationship is derived which relates the topocentric separation of two satellites required for a given level of single-entry protection to the separation and orientation of their service areas. The results are presented explicitly for circular beams and topocentric angles. A computational approach is given for elliptical beams and for use with longitude and latitude variables. It is found that the geocentric separation depends primarily on the service area separation, secondarily on a parameter which characterizes the electrical design, and only slightly on the mean orbital position of the satellites. Both linear programming and mixed integer programming algorithms are implemented. Possible objective function choices are discussed, and explicit formulations are presented for the choice of the sum of the absolute deviations of the orbital locations from some prescribed 'ideal' location set. A test problem involving six service areas is examined with results that are encouraging with respect to applying the linear programming procedure to larger scenarios.

Levis, C. A.↗

Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems

Unmanned vehicles, both aerial and ground, are being used in several monitoring applications to collect data from a set of targets. This article addresses a problem where a group of heterogeneous aerial or ground vehicles with different motion constraints located at distinct depots visit a set of targets. The vehicles also may be equipped with different sensors, and therefore, a target may not be visited by any vehicle. The objective is to find an optimal path for each vehicle starting and ending at its respective depot such that each target is visited at least once by some vehicle, the vehicle–target constraints are satisfied, and the sum of the length of the paths for all the vehicles is minimized. Two variants of this problem are formulated (one for ground vehicles and another for aerial vehicles) as mixed-integer linear programs and a branchand- cut algorithm is developed to compute an optimal solution to each of the variants. Computational results show that optimal solutions for problems involving 100 targets and 5 vehicles can be obtained within 300 seconds on average, further corroborating the effectiveness of the proposed approach.

33 ADVANCED PROPULSION SYSTEMS↗

Efficient Automated Driving Strategies Leveraging Anticipation and Optimal Control

Automated vehicles and advanced driver assistance systems bring computation, sensing, and communication technologies that exceed human abilities in some ways. For example, automated vehicles may sense a panorama all at once, do not suffer from human impairments and distractions, and could wirelessly communicate precise data with neighboring vehicles. Prototype and commercial deployments have demonstrated the capability to relieve human operators of some driving tasks up to and including fully autonomous taxi rides in some areas. The ultimate impact of this technology’s large-scale market penetration on energy efficiency remains unclear, with potential negative factors like road use by empty vehicles competing with positive ones like automatic eco-driving. Fundamentally enabled by historic and look-ahead data, this dissertation addresses the use of automated driving and driver assistance to optimize vehicle motion for energy efficiency. Facets of this problem include car following, co-optimized acceleration and lane change planning, and collaborative multi-agent guidance. Optimal control, especially model predictive control, is used extensively to improve energy efficiency while maintaining safe and timely driving via constraints. Techniques including chance constraints and mixed integer programming help overcome uncertainty and non-convexity challenges. Extensions of these techniques to tractor trailers on sloping roads are provided by making use of linear parameter-varying models. To approach the wheel-input energy eco-driving problem over generally shaped sloping roads with the computational potential for closed-loop implementation, a linear programming formulation is constructed. Distributed and collaborative techniques that enable connected and automated vehicles to accommodate their neighbors in traffic are also explored and compared to centralized control. Using simulations and vehicle-in-the-loop car following experiments, the proposed algorithms are benchmarked against others that do not make use of look-ahead information.

Dollar, Robert Austin↗

Cutting planes for the multistage stochastic unit commitment problem

As renewable energy penetration rates continue to increase in power systems worldwide, new challenges arise for system operators in both regulated and deregulated electricity markets to solve the security-constrained coal-fired unit commitment problem with intermittent generation (due to renewables) and uncertain load, in order to ensure system reliability and maintain cost effectiveness. In this paper, we study a security-constrained coal-fired stochastic unit commitment model, which we use to enhance the reliability unit commitment process for day-ahead power system operations. In our approach, we first develop a deterministic equivalent formulation for the problem, which leads to a large-scale mixed-integer linear program. Then, we verify that the turn on/off inequalities provide a convex hull representation of the minimum-up/down time polytope under the stochastic setting. Next, we develop several families of strong valid inequalities mainly through lifting schemes. In particular, by exploring sequence independent lifting and subadditive approximation lifting properties for the lifting schemes, we obtain strong valid inequalities for the ramping and general load balance polytopes. Lastly, branch-and-cut algorithms are developed to employ these valid inequalities as cutting planes to solve the problem. Our computational results verify the effectiveness of the proposed approach.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Alternative mathematical programming formulations for FSS synthesis

A variety of mathematical programming models and two solution strategies are suggested for the problem of allocating orbital positions to (synthesizing) satellites in the Fixed Satellite Service. Mixed integer programming and almost linear programming formulations are presented in detail for each of two objectives: (1) positioning satellites as closely as possible to specified desired locations, and (2) minimizing the total length of the geostationary arc allocated to the satellites whose positions are to be determined. Computational results for mixed integer and almost linear programming models, with the objective of positioning satellites as closely as possible to their desired locations, are reported for three six-administration test problems and a thirteen-administration test problem.

Reilly, C. H.↗

Heuristic solutions to the single depot electric vehicle scheduling problem with next day operability constraints

This study focuses on the single depot electric vehicle scheduling problem (SDEVSP) within the broader context of the vehicle scheduling problem (VSP). By developing an effective scheduling model using mixed-integer linear programming, we generate bus blocks that accommodate electric vehicles (EVs), ensuring successful completion of each block while considering recharging requirements between blocks and during off-hours. Next day operability constraints are also incorporated, allowing for seamless repetition of blocks on subsequent days. The SDEVSP is known to be computationally complex, deriving optimal solutions unattainable for large-scale problems within reasonable timeframes. To address this, we propose a two-step solution approach: first solving the single depot VSP, and then addressing the block chaining problem (BCP) using the blocks generated in the first step. The BCP focuses on optimizing block combinations to facilitate recharging between consecutive blocks, considering operational constraints. Further, a case study conducted reveals that nearly 100% electrification for Chicago, IL and Austin, TX transit buses is viable yet requires 1.6 EVs at 150-mile range per diesel vehicle.

33 ADVANCED PROPULSION SYSTEMS↗

Robust trajectory-constrained frequency control for microgrids considering model linearization error

Grid supportive modes integrated within inverter-based resources can improve the frequency response of renewable-rich microgrids. The synthesis of grid supportive modes to guarantee frequency trajectory constraints under a predefined disturbance set is challenging but essential. To tackle this challenge, a numerical optimal control (NOC)-based control synthesis methodology is proposed. Without loss of generality, a wind-diesel fed microgrid is studied, where we aim to design grid supportive functions in the wind turbine. In the control design, linearized models are used, and the linearization-induced errors are quantitatively analyzed by reachability and interval arithmetics and represented in the form of interval uncertainties. Then, the NOC problem can be formulated into a robust mixed-integer linear program. The control structure is strategically configured into two levels to realize online deployment. The proposed control is verified on the modified 33-node microgrid with a full-order three-phase nonlinear model in Simulink. In conclusion, the simulation results show the effectiveness of the proposed control paradigm and the necessity of considering linearization-induced uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A VSM-Based DER Dispatch MINLP for Volt-VAR Control in Unbalanced Power Distribution Systems

This paper presents an optimal dispatch algorithm to coordinate customer-owned controllable loads and smart solar inverters with utility-owned voltage regulators and capacitors to meet voltage control objectives. The optimization problem is formulated as a mixed-integer nonlinear programming (MINLP) problem. A voltage sensitivity matrix (VSM) is used to linearize the effect of control actions on the voltage at customer nodes when solving the MINLP. The VSM is recalculated at each time step to improve the computational accuracy. Both discrete switching actions of the capacitor and VRs and the continuous adjustment of real and reactive power from load and smart inverters are considered in the MINLP volt-var problem formulation. The objective function minimizes the cost of all control actions and the magnitude of voltage fluctuations from the previous time period. Constraints ensure that the voltage at each node is maintained within ANSI limits and the feeder power factor is controlled within the desired range. The algorithm is tested using an actual 3-phase unbalanced distribution feeder model. Simulation results demonstrate that the proposed algorithm is computationally feasible on real circuits and improves voltage control while minimizing operational costs.

McEntee, Catie↗

A Bilevel Voltage Regulation Operation for Distribution Systems With Self-Operated Microgrids

The emerging of microgrids in distribution systems has significantly enhanced the resilience of power grids. However, the operators of a distribution system and microgrids therein can be different and have accessibility to different devices. To model the operation of such a grid, this work proposes a bilevel formulation and probes into the voltage regulation operation, considering the interaction between different systems. The proposed bilevel formulation considers the cooperation of active energy resources (AER), transformer tap-changers, and capacitor banks that are controlled by different operators. To facilitate the solution time of the target bilevel optimization, the lower-level problems with different objectives are modeled using deep neural networks (DNNs) which are then converted into a set of constraints. Hence, the bilevel problem can be reformed to a single-level problem. Lastly, the proposed solution procedures are validated using a customized joint system constructed by the IEEE 123-bus system and a real distribution system in Iowa. According to the numerical validation results, the solution time of the proposed nonlinear activation function based DNN model is 69 times faster than other methods in solving voltage regulation with a bilevel structure.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modern modulation schemes: a linear programming based tone injection algorithm for PAPR reduction of OFDM and linearly precoded systems

This work investigates the improvement of power amplifier efficiency through the reduction of peak-to-average power ratio (PAPR) of linearly precoded QAM data signals. In particular, we fo cus on the special cases of linear precoded modulation including the practical OFDM, OFDMA, and SC-FDMA signals that have been widely adopted in W-LAN and W-MAN. We apply the method of tone injection optimization for PAPR reduction. To reduce numerical complexity, we propose a linear programming algorithm which closely approximates the original tone injection optimization problem. Our comprehensive numerical results demonstrate substantial PAPR reduc tion and superior BER performance using several practical examples.

Jacklin, Neil↗

Transient Efficiency Flexibility and Reliability Optimization of Coal-Fired Power Plants: Model-Predictive Control Library Development (Report)

This document pertains to the reporting requirements of DOE contract FE-0031767. The document covers the development of a model predictive control (MPC) library for implementing MPC for a general dynamic system. The library is implemented in a standardized manner in Matlab/Simulink, where core functions on model prediction, linearization and formulation and solution of a quadratic programming (QP) optimization problem is done in the core library - independent of the specific application. The user can provide the application-specific dynamic model in continuous and discrete time, to rapidly implement and test the MPC performance in a desktop simulation. The MPC optimization objective and constraints are also easily configured via an Excel file to allow iterative refinement as needed. Finally, the MPC library enables a rapid deployment to a target environment through auto C-code generation and containerization. The MPC library works seamlessly with the model based estimation (MBE) library to obtain the overall output feedback control solution. In this program, the reduced order model (ROM) of a coal-fired power plant (CFPP) is used to implement and test the MPC solution.

01 COAL, LIGNITE, AND PEAT↗

Substation-Level Grid Topology Optimization Using Bus Splitting

Operations of substation circuit breakers are important for maintenance needs and topology reconfiguration in power systems. Bus splitting is one type of topology change where the two bus bars at a substation can become electrically disconnected under certain actions of circuit breakers. Because these events involve detailed substation modeling, they are typically not considered in routine power system operation and control. In this paper, an improved substation-level topology optimization framework is developed by expanding traditional line switching decisions by breaker-level bus splitting, which can further reduce grid congestion and generation costs. A tight McCormick relaxation is proposed to reformulate the bilinear terms in the resultant optimization problem to linear inequality constraints. Thus, a tractable mixed-integer linear program reformulation is attained that allows for efficient solutions in real-time operations. Numerical studies on the IEEE 14-bus and 118-bus systems demonstrate the computational performance and economic benefits of the proposed topology optimization approach.

bus split↗

A moment approach for entropy solutions to nonlinear hyperbolic PDEs

We propose to solve hyperbolic partial differential equations(PDEs) with polynomial flux using a convex optimization strategy. This approach is based on a very weak notion of solution of the nonlinear equation, namely the measure-valued (mv) solution, satisfying a linear equation in the space of Borel measures. The aim of this paper is, first, to provide the conditions that ensure the equivalence between the two formulations and, second, to introduce a method which approximates the infinite-dimensional linear problem by a hierarchy of convex, finite-dimensional, semidefinite programming problems. This result is then illustrated on the celebrated Burgers equation. Here, we also compare our results with an existing numerical scheme, namely the Godunov scheme.

97 MATHEMATICS AND COMPUTING↗

Control Allocation with Load Balancing

Next generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l1 or l2 norms of the tracking error and of the actuator deflections. The paper discusses the alternative choice of the l(infinity) norm, or sup norm. Minimization of the control effort translates into the minimization of the maximum actuator deflection (min-max optimization). The paper shows how the problem can be solved effectively by converting it into a linear program and solving it using a simplex algorithm. Properties of the algorithm are also investigated through examples. In particular, the min-max criterion results in a type of load balancing, where the load is th desired command and the algorithm balances this load among various actuators. The solution using the l(infinity) norm also results in better robustness to failures and to lower sensitivity to nonlinearities in illustrative examples.

Bodson, Marc↗

Resource Balancing Control Allocation

Next generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l1 or l2 norms of the tracking error and of the control effort. The paper discusses the alternative choice of using the l1 norm for minimization of the tracking error and a normalized l(infinity) norm, or sup norm, for minimization of the control effort. The algorithm computes the norm of the actuator deflections scaled by the actuator limits. Minimization of the control effort then translates into the minimization of the maximum actuator deflection as a percentage of its range of motion. The paper shows how the problem can be solved effectively by converting it into a linear program and solving it using a simplex algorithm. Properties of the algorithm are investigated through examples. In particular, the min-max criterion results in a type of resource balancing, where the resources are the control surfaces and the algorithm balances these resources to achieve the desired command. A study of the sensitivity of the algorithms to the data is presented, which shows that the normalized l(infinity) algorithm has the lowest sensitivity, although high sensitivities are observed whenever the limits of performance are reached.

Frost, Susan A.↗