Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear program”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Utilising demand response for distribution service restoration to achieve grid resiliency against natural disasters

The increased frequency of power outages due to natural disasters in recent years has highlighted the urgency of enhancing distribution grid resilience. The effective distribution service restoration (DSR) is an important measure for a resilient distribution grid. In this work, the authors demonstrate that DSR can be significantly improved by leveraging the flexibility provided by the inclusion of demand response (DR). The authors propose a framework for this by considering integrated control of household-level flexible appliances to vary the load demand at the distribution-grid level to improve DSR. The overall framework of the proposed system is modelled as a three-step method considering three optimization problems to (i) calculate feasible controllable aggregated load range for each bus, (ii) determine candidate buses to perform DR and their target load demand, and (iii) maintain the load level in each house through home energy management during the DSR, considering uncertainties in load and solar generation sequentially. The optimization problems are formulated as linear programming, mixed-integer linear programming, and multistage stochastic programming (solved using the stochastic dual dynamic programming) models. Finally, case studies performed in the IEEE 123-node test feeder show improvements in resilience in terms of energy restored compared to the restoration process without DR.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

or-topas: Operations Research Toolkit for Pyomo Alternative Solutions

SAND2026-16702O OR-TOPAS: Operations Research Toolkit for Pyomo Alternative Solutions is a tool that enhances optimization applications defined by the Pyomo modeling library. It offers functions to generate optimal or near-optimal solutions, operating independently of Pyomo’s solver interface. Users can configure these functions with specific solver names and options, resulting in a custom solution object that returns a list of solutions. The OR-TOPAS library includes methods tailored to the properties of the model, such as binary integer programs versus linear programs, and specific solver interfaces like Gurobi. It does not provide models for specific applications, but it is applicable to a wide range of Pyomo optimization models. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Siirola, John [Sandia National Lab. (SNL-CA), Live↗
DOE OSTI2017

Security and Cloud Outsourcing Framework for Economic Dispatch

The computational complexity and problem sizes of power grid applications have increased significantly with the advent of renewable resources and smart grid technologies. The current paradigm of solving these issues consist of inhouse high performance computing infrastructures, which have drawbacks of high capital expenditures, maintenance, and limited scalability. Cloud computing is an ideal alternative due to its powerful computational capacity, rapid scalability, and high cost-effectiveness. A major challenge, however, remains in that the highly confidential grid data is susceptible for potential cyberattacks when outsourced to the cloud. In this work, a security and cloud outsourcing framework is developed for the Economic Dispatch (ED) linear programming application. As a result, the security framework transforms the ED linear program into a confidentiality-preserving linear program, that masks both the data and problem structure, thus enabling secure outsourcing to the cloud. Results show that for large grid test cases the performance gain and costs outperforms the in-house infrastructure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Fitting program for linear regressions according to Mahon (1996)

This program takes the users' Input data and fits a linear regression to it using the prescription presented by Mahon (1996). Compared to the commonly used York fit, this method has the correct prescription for measurement error propagation. This software should facilitate the proper fitting of measurements with a simple Interface.

Trappitsch, RetoG.↗
DOE OSTI2022

Economic and Environmental Analysis to Evaluate the Potential Value of Co-Optima Diesel Bioblendstocks to Petroleum Refiners

The U.S. petroleum refining sector is undergoing a period of historic transformation, catalyzed by the decarbonization of the U.S. economy. Diesel-boiling-range bioblendstocks have gained traction, owing to their superior fuel properties and environmental performance as compared to traditional petroleum fuels. This work couples refinery linear programming models with life cycle assessment to quantify the potential economic and environmental benefits, and trade-offs, of blending diesel-boiling-range bioblendstocks at petroleum refineries. Linear programming models were developed in Aspen Process Industry Modeling Systems (PIMS) for three representative petroleum refinery configurations of differing complexity. Seven diesel-boiling-range bioblendstocks: 4-butoxyheptane, 5-ethyl-4-propylnonane, soy biodiesel, sludge hydrothermal liquefaction diesel, polyoxymethylene ethers, renewable diesel, and hexyl hexanoate, were investigated to identify key fuel properties that influence refineries' economics and to track the effect of adding bioblendstocks on refinery-wide cradle-to-gate greenhouse gases (GHG) emissions. These analyses considered blending levels from 10 to 30 vol% and fuel demand projections over the period 2040 to 2050. This analysis determines that bioblendstock sulfur content and cetane number are the primary fuel attributes with the potential to provide value to refiners. Life cycle assessment results indicate that the use of diesel-boiling-range bioblendstocks can reduce cradle-to-gate refinery GHG emissions by up to ~ 40 % relative to conventional refinery operations when considering carbon uptake in the supply chain of the bioblendstock. Refinery-wide marginal GHG abatement costs range from 120 to 3,600 USD2016/metric tons carbon dioxide equivalent avoided across the scenarios evaluated. Reducing the price of bioblendstocks is identified as a key to their adoption.

ADVANCED PROPULSION SYSTEMS,BIOMASS FUELS,ENERGY P↗
DOE OSTI2020

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs

A lower bound for a finite-scenario-based chance-constrained program is the quantile value corresponding to the sorted optimal objective values of scenario subproblems. This quantile bound can be improved by grouping subsets of scenarios at the expense of solving larger subproblems. The quality of the bound depends on how the scenarios are grouped. In this paper, we formulate a mixed-integer bilevel program that optimally groups scenarios to tighten the quantile bounds. For general chance-constrained programs, we propose a branch-and-cut algorithm to optimize the bilevel program, and for chance-constrained linear programs, a mixed-integer linear-programming reformulation is derived. Here, we also propose several heuristics for grouping similar or dissimilar scenarios. Our computational results demonstrate that optimal grouping bounds are much tighter than heuristic bounds, resulting in smaller root-node gaps and better performance of scenario decomposition for solving chance-constrained 0-1 programs. Also, the optimal grouping bounds can be greatly strengthened using larger group size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Optimal allocation of series FACTS devices in large‐scale systems

Series flexible AC transmission systems devices, such as the variable series reactor, have the ability to continuously regulate the transmission line reactance so as to control power flow. This study presents a new approach to optimally locating such devices in the transmission network considering multiple operating states and contingencies. To investigate optimal investment, a single target year planning with three different load patterns is considered. The transmission contingencies may occur under any of the three load conditions and the coupling constraints between base case and contingencies are included. A reformulation technique transforms the original mixed integer non‐linear programming model into mixed integer linear programming model. To further relieve the computational burden and enable the planning model to be directly applied to practical large‐scale systems, a two‐phase decomposition algorithm is introduced. Detailed numerical simulation results on IEEE 118‐bus system and the Polish 2383‐bus system illustrate the efficient performance of the proposed algorithm.

Zhang, Xiaohu↗
DOE OSTI2022

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

A Tutorial for Using an Open-Source Solver for the Regional Energy Deployment System (ReEDS) Model

ReEDS is a publicly available model developed at NREL that can be used to analyze the potential evolution of the U.S. electric power system into the future. ReEDS is formulated as a linear program, written in GAMS, and solved using a linear programming solver (e.g., CPLEX). This tutorial provides context and understanding for the implications of using an open-source solver for ReEDS.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method

We study the problem of designing scalable algorithms to find effective intervention strategies for controlling stochastic epidemic processes on networks. This is a common problem arising in agent based models for epidemic spread. Previous approaches to this problem focus on either heuristics with no guarantees or approximation algorithms that scale only to networks corresponding to county-sized populations, typically, with less than a million nodes. In particular, the mathematical-programming based approaches need to solve the Linear Program (LP) relaxation of the problem using an LP solver, which restricts the scalability of this approach. In this work, we overcome this restriction by designing an algorithm that adapts the multiplicative weights update (MWU) framework, along with the sample average approximation (SAA) technique, to approximately solve the linear program (LP) relaxation for the problem. To scale this approach further, we provide a memory-efficient algorithm that enables scaling to large networks, corresponding to country-size populations, with over 300 million nodes and 30 billion edges. Furthermore, we show that this approach provides near-optimal solutions to the LP in practice.

Sambaturu, Prathyush↗
DOE OSTI2021

Sizing Energy Storage System for Energy Arbitrage in Extreme Fast Charging Station

This paper proposes a non-linear programming (NLP) model to optimally size the energy storage system (ESS) and obtain an optimal energy management for energy arbitrage of an extreme fast charging station (XFCS) for electric vehicles (EVs), with minimized total cost of XFCS operation and ESS investment. Different from most reported work on sizing the ESS for EV charging stations, this paper proposes a pragmatic approach to model the ESS life degradation and accurately count the ESS cycles. Moreover, this work incorporates the peak demand charges in the operational cost of the charging station which are often overlooked in the literature. The proposed model is formulated and solved using AIMMS. Finally, a thorough sensitivity analysis is performed to offer insights into how different input parameters impact the ESS sizing and savings from the energy arbitrage perspective.

25 ENERGY STORAGE↗
DOE OSTI2018

Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution

In order to express a polyhedron as the Minkowski sum of a polytope and a polyhedral cone, Motzkin (Beiträge zur Theorie der linearen Ungleichungen. Dissertation, University of Basel, 1936) devised a homogenization technique that translates the polyhedron to a polyhedral cone in one higher dimension. Refining his technique, we present a conical representation of a set in the Euclidean space. Then, we use this representation to reach four main results: First, we establish a convex programming based framework for determining a maximal element—an element with the maximum number of positive components—of a non-negative convex set—a convex set in the non-negative Euclidean orthant. Second, we develop a linear programming problem for finding a relative interior point of a polyhedron. Third, we propose two procedures for identifying a strictly complementary solution in linear programming. Finally, we generalize Motzkin’s (Beiträge zur Theorie der linearen Ungleichungen. Dissertation, University of Basel, 1936) representation theorem for a class of closed convex sets in the Euclidean space.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

Dispatch optimization of electric thermal energy storage within System Advisor Model

A stand-alone electric thermal energy storage (ETES) system converts low-value electricity into heat using resistance heating elements. During periods of high-value electricity, an ETES system uses a thermodynamic power cycle to convert stored thermal energy back to electricity. These dispatchable systems derive value from their ability to store energy when prices are low and generate electricity when prices are favorable, i.e., energy arbitrage. Consequently, dispatch optimization of system operations, through maximizing revenue subject to system constraints, is essential to evaluate the economic value of a particular system design. While stand-alone ETES systems offer potential advantages as dispatchable grid storage technologies, there is a lack of a neutral third-party, publicly available, open-source model to evaluate the performance, dispatch, and financial viability of these systems. To address this problem, we have developed a techno-economic model for stand-alone ETES systems, within National Renewable Energy Laboratory's (NREL's) System Advisor Model (SAM). We implement a mixed-integer linear program to determine an ETES optimal operating schedule that maximizes electricity sales less maintenance costs caused by operation and cycling given temporal-varying grid electricity prices. Our contributions include a mixed-integer linear program for energy arbitrage of an ETES system, an ETES performance model through a publicly-available software (i.e., SAM), and an exercise of our model through case studies that compare ETES operational strategies and annual financial metrics. With our dispatch optimization model, we were able to improve revenue by 20% compared to a myopic heuristic while reducing the operational cost of the ETES system through decreases in cycle starts, cycles per day, and heater starts.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Parallel programming of an ionic floating-gate memory array for scalable neuromorphic computing

Neuromorphic computers could overcome efficiency bottlenecks inherent to conventional computing through parallel programming and readout of artificial neural network weights in a crossbar memory array. However, selective and linear weight updates and <10-nanoampere read currents are required for learning that surpasses conventional computing efficiency. We introduce an ionic floating-gate memory array based on a polymer redox transistor connected to a conductive-bridge memory (CBM). Selective and linear programming of a redox transistor array is executed in parallel by overcoming the bridging threshold voltage of the CBMs. Synaptic weight readout with currents <10 nanoamperes is achieved by diluting the conductive polymer with an insulator to decrease the conductance. The redox transistors endure >1 billion write-read operations and support >1-megahertz write-read frequencies.

bio-inspired, energy storage (including batteries ↗