Product form of inverses of sparse matrices Progress report
Product form of inverses of sparse matrices - matrix algebra and linear programming codes
SEARCH · Engineering Papers
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.
Product form of inverses of sparse matrices - matrix algebra and linear programming codes
Geometric interpretation of product form of inverse applied to sparse matrices in linear programming, using graph theory
This paper presents a model-based predictive control strategy to optimize the operations of phase change material (PCM) ceiling panels coupled with a multi-stage air-source heat pump. A three-stage prototype heat pump unit has been built and tested in the laboratory, with the low and medium stages designed for space heating/cooling and the high compression stage dedicated to charging of the PCM energy storage. To facilitate optimal control of the integrated heat pump system, a mixed-integer linear programming formulation is derived through linearization of the heat pump model and a mixed-integer reformulation of the PCM dynamic governing equations. A predictive control strategy is synthesized based on the resultant control formulation and implemented in a receding horizon scheme that optimizes the PCM charging and the zone temperature schedules simultaneously to leverage both the passive (associated with building construction materials) and active (PCM) storage capacities of a building. The control strategy has been tested along with three benchmarking control scenarios using a co-simulation platform for a prototypical detached house in Atlanta, GA. In this study, test results showed that application of the proposed control strategy to the PCM-integrated heat pump could provide 27.1% electricity cost savings while a fine tuned rule-based control strategy could achieve cost savings of 20.4%, compared to a baseline case without PCM storage, under a time-of-use rate tariff.
The load profiles of most commercial and industrial consumers are characterized by brief periods of very high power consumption followed by intervals of lower demand. To encourage such consumers to flatten their load profiles, power utilities in and around the world often levy a monthly demand charge (DC) on the peak demand measured over brief intervals. In this work, we consider the joint optimization of energy costs (EC) and the instantaneous peak power of a multi-unit building which uses a hydronic heating, ventilation and cooling (HVAC) system and responds to a demand response (DR) program. Despite the non-linear structure of the problem, we show how optimal solutions can be obtained efficiently using linear programming. Next, we study the power demand patterns resulting from our proposed strategy for thermostatically controlled loads (TCLs), and evaluate the strategy’s performance for various climate zones in the US, under both typical and atypical weather conditions. Finally, the results show that depending on the ambient conditions and the tariff structure, our strategy can result in utility bill savings of up to nearly 19% compared to the baseline. The results also indicate that our power control strategy can significantly reduce the instantaneous peak power consumption in commercial TCLs.
The load profiles of most commercial consumers are characterized by brief periods of very high power consumption followed by intervals of relatively lower demand. In order to flatten commercial load profiles, several power utilities in addition to billing energy consumption, levy a demand charge (DC) on the monthly peak demand. In this work, we consider the problem of joint optimization of energy costs (EC) and DC incurred by a multi-unit building which follows a demand response (DR) program. Despite the non-linear structure of the problem, we show how the optimal solutions can be obtained efficiently using linear programming. We evaluate the performance of the proposed power control scheme for various climate zones in the US. We show that depending on the ambient conditions and the prescribed tariff structure, our strategy can result in savings of up to nearly 19% compared to the baseline.
Improved Exploratory Search Technique for Pure Integer Linear Programming Problems (IESIP) program optimizes objective function of variables subject to confining functions or constraints, using discrete optimization or integer programming. Enables rapid solution of problems up to 10 variables in size. Integer programming required for accuracy in modeling systems containing small number of components, distribution of goods, scheduling operations on machine tools, and scheduling production in general. Written in Borland's TURBO Pascal.
The computational procedure and associated computer program for a linear feature selection technique are presented. The technique assumes that: a finite number, m, of classes exists; each class is described by an n-dimensional multivariate normal density function of its measurement vectors; the mean vector and covariance matrix for each density function are known (or can be estimated); and the a priori probability for each class is known. The technique produces a single linear combination of the original measurements which minimizes the one-dimensional probability of misclassification defined by the transformed densities.
A relationship is derived, on a single-entry interference basis, for the minimum allowable spacing between two satellites as a function of electrical parameters and service-area geometries. For circular beams, universal curves relate the topocentric satellite spacing angle to the service-area separation angle measured at the satellite. The corresponding geocentric spacing depends only weakly on the mean longitude of the two satellites, and this is true also for alliptical antenna beams. As a consequence, if frequency channels are preassigned, the orbital assignment synthesis of a satellite system can be formulated as a mixed-integer programming (MIP) problem or approximated by a linear programming (LP) problem, with the interference protection requirements enforced by constraints while some linear function is optimized. 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 is posed consisting of six service areas, each served by one satellite, all using elliptical antenna beams and the same frequency channels. Numerical results are given for the three ideal location prescriptions for both the MIP and LP formulations. The resulting scenarios also satisfy reasonable aggregate interference protection requirements.
The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.
GENHYP FORTRAN 5 program for general linear hypothesis testing
The environmental and economic impacts of implementing a circular economy in plastic waste supply chains are not well understood. The proposed systems analysis framework assesses environmental, social, and economic impacts of plastic waste supply chains in a circular economy. The first objective of this article is to identify datasets, models and knowledge gaps associated with waste plastic supply chain processes, mainly in the U.S. Our literature review indicated that the best datasets exist for virgin plastic resin production, mechanical recycling, landfilling, and incineration, with materials recovery facility being intermediate, and with chemical recycling the lowest. The second objective of this article is to develop an illustrative application of the framework by conducting a preliminary systems analysis of PET bottles with closed-loop recycling. Here, the preliminary systems analysis of PET bottles utilized a linear programming optimization method. Our optimization model indicated that both chemical and mechanical recycling processes are needed to achieve a true circular economy of PET bottles with the least greenhouse gas emissions, specifically reductions of 24% when compared with the linear economy. Good quality and standardized life cycle assessment and techno-economic analysis studies are needed to better understand the environmental, economic, and social impacts of advanced sorting and chemical recycling technologies.
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.
Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.
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.
Distributed energy resources (DERs) are rocking the utilities’ business landscape. It calls for competitive market environments that incentivize DERs to form maximum operating efficiency. Among proposed pricing schemes, distribution-level locational marginal price (DLMP) is effective in signaling the marginal generation cost differences driven by energy losses and network constraints. It can be derived from a distribution-level optimal power flow (OPF) framework, as it essentially presents the sensitivity of optimized generation cost towards incremental loads. However, due to the high resistance-to-inductance ratio and unbalanced characteristics of distribution networks, computational affordable DLMPs are highly challenged. This article provides a linear-approximated DLMP that can be solved efficiently and generalized to account for reactive power flow, three-phase unbalanced loads and meshed network structure. The successive linear programming technique is introduced to enhance the model accuracy. Case studies on an IEEE 123-Bus system validate its accuracy against a nonlinear benchmark and capability in offering proper incentives.
A nuclear-based integrated energy system (IES), consisting of multiple carbon-free energy generation and conversion technologies to meet heterogeneous end-use demands, offers a promising approach to decarbonizing the U.S. economy. Operating such an IES is challenging due to its complexity and the diverse end-use demands, such as heating and electricity. This paper aims to address the optimal operation of an IES composed of a small modular reactor (SMR), a steam manifold, a balance of plant (BOP), a high-temperature steam electrolysis (HTSE) system, a district heating (DH) network, and electrical grids. We formulate the system’s operation as a mixed integer linear programming (MILP) problem to maximize net revenues from sales of electricity and hydrogen. To evaluate the efficacy of the proposed model, we conduct a 24-hour simulation considering day-ahead (DA) electricity prices from CAISO and a varying DH demand profile with hourly resolution. The simulation results show that our model effectively optimizes the operation by selling electricity during on-peak periods and purchasing electricity for hydrogen production during off-peak periods, while satisfying operating constraints within the IES.
In this work, we present a three-stage multiobjective mixed-integer linear programming (MILP) for the optimal expansion planning and operation of isolated multienergy microgrids in remote areas. By selecting the optimal distributed generators (DGs) and energy storage systems (ESSs) mix selection, siting, sizing, and scheduling in the remote microgrid, the proposed model is targeted to minimize the annualized total cost of microgrids while enhancing the performance of the system, i.e., minimizing the voltage deviations and line power loss. To represent the electricity and heat flow between generation resources and various electrical, heating, and cooling loads in the isolated microgrid, linearized power flow, and heat flow constraints are employed in the proposed optimization model. The available capacity of DGs and ESSs are modeled as discrete constants instead of continuous variables for practical purpose. Numerical simulation results on a remote microgrid consisting of DGs, ESSs, and various loads validate the proposed method.
In this paper we consider service migration problem for Data and Reasoning Fabric (DRF) enabled airspace operations assuming a fixed cloud/edge infrastructure with allocated computing, storage and power resources, where cloud/edge servers, and communication stations are in a wired connected network, while vehicles use a wireless network for communication. The objective is to automatically select the best location for the requested service execution, which achieves minimum cost while satisfying the user quality of service (QoS) and available resources constraints. To this end, estimates of the response time, consumed energy and total cost are defined for each potential compute location. A mixed-integer linear program is then formulated and solved to identify optimal compute locations given QoS constraints, network infrastructure limitations, with worst-case vehicle positioning. The approach is applied to trajectory re-planning use case to avoid a collision with an emergency vehicle in real time.