Search NASA⌕ Search

SEARCH · Search NASA

Results for “MILP”

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 145 records · Page 8

Decomposition and Algorithmic Approaches for Solving Large-Scale Process Family Design Problems

Our most recent work expands the water desalination case study from 76 variants to 10,897 variants using the equation-oriented model built in Pyomo as part of the PARETO project. Using the discretization formulation presented in Stinchfield (2024a), rather than solving for all 10,897 variants simultaneously, we decompose the formulation into subproblems containing subsets of variants from the process family. We solve the overall problem with Progressive Hedging (PH) deployed in parallel on a distributed HPC cluster using the open-source Python package mpi-sppy (Knueven et al., 2023). This approach allowed us to solve this process family design problem to ~1.5% relative optimality gap in about 5 hours; in comparison, Gurobi reached ~50% relative optimality gap in about 6 hours (Stinchfield et al., 2024b). However, this approach still requires discretization of the common unit module design ranges; additionally, PH acts as a heuristic for MILP’s with gap-closing capabilities. Ideally, we would not have to use ML surrogates or discretization to solve this problem, instead solving the process family design problem with the equation-oriented model directly to achieve the most accurate results. However, recall that we did not consider solving the MINLP directly due to complexity and size. In this work, we aim to decompose and solve this large-scale MINLP using a Structured Nonlinear Global Optimization algorithm presented by Cao and Zavala (2019).

Stinchfield, Georgia↗

Storage Viability and Optimization Web Service

Non-residential sectors offer many promising applications for electrical storage (batteries) and photovoltaics (PVs). However, choosing and operating storage under complex tariff structures poses a daunting technical and economic problem that may discourage potential customers and result in lost carbon and economic savings. Equipment vendors are unlikely to provide adequate environmental analysis or unbiased economic results to potential clients, and are even less likely to completely describe the robustness of choices in the face of changing fuel prices and tariffs. Given these considerations, researchers at Lawrence Berkeley National Laboratory (LBNL) have designed the Storage Viability and Optimization Web Service (SVOW): a tool that helps building owners, operators and managers to decide if storage technologies and PVs merit deeper analysis. SVOW is an open access, web-based energy storage and PV analysis calculator, accessible by secure remote login. Upon first login, the user sees an overview of the parameters: load profile, tariff, technologies, and solar radiation location. Each parameter has a pull-down list of possible predefined inputs and users may upload their own as necessary. Since the non-residential sectors encompass a broad range of facilities with fundamentally different characteristics, the tool starts by asking the users to select a load profile from a limited cohort group of example facilities. The example facilities are categorized according to their North American Industry Classification System (NAICS) code. After the load profile selection, users select a predefined tariff or use the widget to create their own. The technologies and solar radiation menus operate in a similar fashion. After these four parameters have been inputted, the users have to select an optimization setting as well as an optimization objective. The analytic engine of SVOW is LBNL?s Distributed Energy Resources Customer Adoption Model (DER-CAM), which is a mixed-integer linear program (MILP) written and executed in the General Algebraic Modeling System (GAMS) optimization software. LBNL has released version 1.2.0.11 of SVOW. Information can be found at http://der.lbl.gov/microgrids-lbnl/current-project-storage-viability-website.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer

Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a minimum-energy state of the quantum system. While many NP-hard problems can be easily formulated as binary quadratic optimization problems, such formulations almost always contain one or more constraints, which are not allowed in a QUBO. Embedding such constraints as quadratic penalties is the standard approach for addressing this issue, but it has drawbacks such as the introduction of large coefficients and using too many additional qubits. In this paper, we propose an alternative approach for implementing constraints based on a combinatorial design and solving mixed-integer linear programming (MILP) problems in order to find better embeddings of constraints of the type Σ x i = k for binary variables x i . Our approach is scalable to any number of variables and uses a linear number of ancillary variables for a fixed k.

97 MATHEMATICS AND COMPUTING↗

Supplementary spatial data for Available Land for Cellulosic Biofuel Production: A Supply Chain Centered Comparison

Collection of the underlying spatially explicit data for Available Land for Cellulosic Biofuel Production: A Supply Chain Centered Comparison. Includes raw biomass yield data and soil carbon sequestration potential data for three types of marginal land for the USA midwest at the field level including field areas. Collection also includes raw land rasters for the three types of marginal land, model parameters for the MILP model used in the study, and results used to generate the figures in the paper.

bioenergy landscape design↗

Optimal Equilibrium Selection of Price-Maker Agents in Performance-Based Regulation Market

This paper analyzes the oligopolistic equilibrium of multiple price-maker agents in performance-based regulation (PBR) markets. In these markets, there are price-maker agents representing some frequency regulation (FR) providers and a number of independent price-taker FR providers. An equilibrium problem with equilibrium constraints (EPEC) model is employed in this paper to study the equilibria of a PBR market in the presence of price-maker agents and pricetaker FR providers. Due to the incorporation of the FR providers' dynamics, the proposed model is reformulated as a mixed-integer linear programming (MILP) problem over innovative mathematical techniques. An optimal equilibrium point is also selected for the market, where none of the agents is unique deviator and the dynamic performance of power system is improved simultaneously. The effectiveness of proposed optimal equilibrium point is evaluated in the numerical results section by comparing the outputs with conventional optimal dispatches of the FR providers.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Design and Optimization of Processes for Recovering Rare Earth Elements from End-of-Life Hard Disk Drives

In this conference paper, we propose a superstructure-based approach to finding the optimal pathways for recovering rare earth elements in their commercialized rare earth oxide form from end-of-life HDDs. The proposed superstructure was modeled as a MILP optimization problem, selecting the net present value as the objective function. Whenever possible, costing data taken from the literature was used to inform this mode. However, due to the novelty of this research area data were often not available thus requiring the generation of flowsheets that were implemented in Aspen Plus. To establish the base case optimal result, projections for the number of EOL HDDs in the U.S. available for recycling and estimates of the projected rare earth oxide prices over the lifetime of the plant were used to inform the model. The model was then expanded to include the recycling of EOL HDDs generated prior to the beginning of plant production (period ranging from 2006 through 2024).

Laliwala, Chris↗

Optimal Design of Food Packaging Considering Waste Management Technologies to Achieve Circular Economy

Plastic packaging plays a fundamental role in the food industry, avoiding food waste and facilitating food access. The increasing plastic production and the lack of appropriate plastic waste management technologies represent a threat to the environmental and human welfare. Therefore, there is an urgent need to identify sustainable packaging solutions. Circular economy (CE) promotes reducing waste and increasing recycling practices to achieve sustainability. In this work, we propose a CE framework based on multi-objective optimization, considering both economic and environmental impacts, to identify optimal packaging designs and waste management technologies. Using mixed-integer linear programming (MILP), techno-economic analysis (TEA), and life cycle assessment (LCA), this work aims to build the first steps in packaging design, informing about the best packaging alternatives and the optimal technology or technologies to process packaging waste. For the economic analysis, we consider the minimum increase in price (MIP) when adding recycling to the cost of each packaging solution, while for the environmental analysis, the greenhouse gas emissions impact was considered. A case study on ground coffee packaging is used to illustrate the proposed framework. The results demonstrate that the multilayer bag option is the most convenient when considering both the chosen economic and environmental impacts.

Life Cycle Analysis↗

Optimal Integration of Departure and Arrivals in Terminal Airspace

Coordination of operations with spatially and temporally shared resources such as route segments, fixes, and runways improves the efficiency of terminal airspace management. Problems in this category include scheduling and routing, thus they are normally difficult to solve compared with pure scheduling problems. In order to reduce the computational time, a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA) was introduced in this work and applied to a test case based on existing literature. The experiment showed that new method can solve the whole problem in fast time instead of solving sub-problems sequentially with a window technique. The results showed a 60% or 406 second delay reduction was achieved by sharing departure fixes (more details on the comparison with MILP results will be presented in the final paper). Furthermore, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial segregation, which may introduce unnecessary delays. In this work, spatial segregation, temporal segregation, and hybrid segregation were formulated using the new algorithm. Results showed that spatial and temporal segregation approaches achieved similar delay. Hybrid segregation introduced much less delay than the other two approaches. For a total of 9 interacting departures and arrivals, delay reduction varied from 4 minutes to 6.4 minutes corresponding flight time uncertainty from 0 to 60 seconds. Considering the amount of flights that could be affected, total annual savings with hybrid segregation would be significant.

high density terminal↗

Scenario Complexity for Unmanned Aircraft System Traffic

This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time apA quick and accurate assessment of complexity for a given traffic scenario can help plan and schedule flights to alleviate traffic bottleneck and mitigate operation risks, especially for unmanned aerial system traffic management where high traffic density or complexity is expected. This work introduces a traffic scenario complexity metric that was constructed based on the number of potential conflicts weighted by the conflict resolution cost associated. The cost associated with a conflict is calculated based on the corresponding conflict resolution maneuvers. To obtain the conflict resolution maneuvers, a MILP-based optimization was formulated with the vehicle model and conflict management parameters incorporated. To evaluate the complexity metrics, an approach of using measurements from high-fidelity simulations was proposed. The scenario complexity measurements for 920 random-generated scenarios were obtained through high-fidelity simulations and treated as the ground truth. Two statistics methods: Pearson and Alternative Conditional Expectations were applied for analysis. The results showed that the number of flights has low correlation with the scenario complexity according to the correlation coefficients calculated by both methods. The Alternative Conditional Expectations method shows that the proposed scenario complexity metric has better correlation with the ground truth than the number of potential conflicts.plications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.

traffic complexity↗

Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition

Multi-robot systems are uniquely well-suited to perform complex tasks such as patrolling and tracking, infor- mation gathering, and pick-up and delivery problems, offering significantly higher performance than single-robot systems. A fundamental building block in most multi-robot systems is dynamic task allocation: assigning robots to tasks (e.g., patrolling an area, or servicing a transportation request) as they appear based on the robots’ states to maximize reward. In many practical situations, the allocation must account for potentially heteroge- neous capabilities (e.g., availability of appropriate sensors or actuators) to ensure the feasibility of execution, and exploit predictive information concerning the likelihood of future tasks to promote a higher reward over a long time horizon. To this end, we present an efficient algorithm for predictive heterogeneous task- allocation achieving an approximation factor of at least 1/2 of the optimal reward. Our approach demonstrates that the problem can be decomposed into several homogeneous subproblems that can be solved efficiently using min-cost flow. Through simulation experiments, we show that our algorithm is faster by several orders of magnitude than a MILP-based approach.

Pavone, Marco↗

Localization of Ad-Hoc Lunar Constellations in Communication Failure Modes for Distributed Spacecraft Autonomy

As lunar missions increase in complexity inspired by NASA’s Artemis Program, they will require reliable and sufficient capability of the Position, Navigation, and Timing (PNT) system to support their scientific objectives. In addition, NASA's Commercial Lunar Payload Services (CLPS) program initiates the proliferation of public and private exploration partnerships using small satellites from commercial and private organizations, expanding traditionally confined low Earth orbit to be used for missions beyond geosynchronous orbit (Zucherman et al., 2022). Therefore, the Lunar PNT system is also required to provide navigation services compatible with the smaller platforms being sent by the public and private sectors, like CubeSats. However, traditional approaches to deep space missions’ navigation based on ground radio facilities have difficulties in providing sufficient support for the increasing number of users and communication at a distance from the Earth (Kaplev et al., 2022). In particular, the existing Lunar navigation technologies such as weak signal global positioning system (GPS) and deep space network (DSN) are not able to ensure operations of the upcoming small-scale Lunar missions due to their limitations in localization performance as well as capacity aspects. Another way to provide Lunar PNT service is to create a dedicated Lunar global navigation satellite system (GNSS) constellation, like GNSS systems on Earth. Space agencies like NASA, ESA, and JAXA are now developing the lunar communications relay and navigation systems (LCRNS) and Lunar navigation satellite systems (LNSS). In their systems, satellites will be deployed in moon orbits to provide the communication, positioning, navigation, and timing (CPNT) service at the lunar south pole region where the Artemis base camp will be expected (Murata et al., 2022). Meanwhile, common challenges considered in lunar PNT research arise from poor geometry of the terrestrial GNSS satellites when seen from the lunar user, highly perturbed lunar orbits, and limitations in power, size, and cost of the equipment on lunar satellites (Iiyama et al., 2023). It is also not clear if there will be enough Lunar users to support the cost and resources this would require as the Low-cost surface missions may not be able to support the large power, mass, and weight requirements that these navigation solutions entail (Niemoeller et al., 2022). As an alternative, existing Lunar science and exploration assets could be used to create a low-cost, autonomous, ad-hoc, and on-demand mission-centric Lunar PNT swarm capable of providing PNT services to these low-cost lunar missions (Hagenau et al., 2021). Introducing the non-dedicated and ad-hoc Lunar navigation constellation gives a way to provide PNT services on-demand. The non-dedicated swarm assets of Lunar constellations are designed to localize themselves with minimal interaction with Earth by adding cooperative autonomous localization to lunar missions, freeing up valuable bandwidth and ground segment resources. An autonomous localization of Lunar constellations is based on the concept of the decentralized PNT system with a distributed extended Kalman filter (DEKF) approach to state estimation for minimal onboard operating costs. In the distributed data processing algorithm, computation is broken down and assigned to each satellite, resulting in a considerably decreased computational amount while maintaining the accuracy of the orbit ephemeris and clock offsets as the result of centralized data processing (Wen et al., 2019). The DEKF requires spacecraft to perform two-way ranging operations with each other to communicate simultaneously, leveraging neighbor two-way intersatellite link (ISL) measurements such as pseudoranges to, and relative velocities between, visible satellites as sensor values (Frank et al., 2021). The Lunar autonomous PNT simulation (LAPS) demonstrated the feasibility of orbital asset localization among ad-hoc Lunar small-sat constellations based on the DEKF in Hagenau et al. (2021) and evaluated the matching algorithm proposed by Frank et al. (2021) in scheduling position estimation updates. In previous papers, all assets and measurements are assumed to be always available without consideration of the impact of intermittent and permanent communication failure. This study presents localization performance with increasing levels of network degradation for swarm assets and users to demonstrate the robustness of the decentralized Lunar PNT service in more realistic scenarios. Main issues arising from communication failure include spacecraft permanent or transient loss, antenna failures, message delays, etc. We tested four possible reasons for network degradation for 7 days in 21 satellites frozen with an altitude of 5500 km, evenly spaced around 3 circular, 40 inclination orbital planes where each spacecraft has two directional antennas. As anchor nodes with an independent estimate of their position are required in the DEKF approach, two ground nodes in each pole and one node in the gateway were implemented in the simulation. First, the most probable failure scenario involves the loss of a single spacecraft due to solar interference and technical malfunctions of the assets. Losing the availability of a single spacecraft means losing the two-way ISL measurement of the asset in the DEKF update. In order to provide the best possible quality of PNT service with limited time and resources, the distributed Lunar constellations must schedule the communication activities. The scheduler leverages mixed-integer linear programming (MILP) for the coordination and scheduling of the desired “as-needed” localization service (Niemoeller et al., 2022). We assume the scheduler has completely excluded the spacecraft information before the DEKF update in the failure scenario. When a random spacecraft has been turned off at a specific time, the robustness of the autonomous Lunar PNT system is evaluated. The simulation results give an 11.5% degradation in median position accuracy compared to the idealized performance excluding the asset loss. Second, a large number of assets may vanish due to major hardware problems or meteor strikes around the moon. A multiple spacecraft loss can degrade the localization performance very fast by losing the communication ability to do cross-plane measurements and in-plane measurements in a 3-plane constellation. When the matching-based scheduler is aware of ISL availability, we investigate a large number of in-plane and cross-plane asset vanishments both in close proximity and equally spaced throughout the orbital plane. According to the simulations, the loss of in-plane measurements gives 40.2% degradation while cross-plane measurements degrade 50.5% of asset localization performance among available assets. Therefore, it is concluded that cross-plane measurements are more important in improving the position estimation accuracy. Third, spacecraft failure information can be lost due to the internal message delay, resulting in the DEKF update scheduler to solve the matching problem with unavailable assets. The DEKF update cycle is comprised of network setup, communication, and computations where a global broadcast network and a 2-way ISL network setup take 6 minutes in total (Frank et al., 2021). Once the broadcast network successfully transmits and receives information, a random spacecraft may lose its availability right before solving the matching problem. This means the matching solution is no longer optimal, resulting in degradation in the localization performance. A numerical assessment shows the matching-based scheduler with knowing failure holds 11.5% of position accuracy degradation, whereas the scheduler without knowing failure gives 34% degraded localization performance without asset loss. Fourth, a transient loss of a single or multiple spacecraft may occur due to their antenna outages. After losing the two-way ISL availability for a few DEKF update cycles, the availability of spacecraft can easily be recovered as their states have been independently updated using measurements from anchor nodes. It is likely that the longer failure will result in worse localization performance. We have tested the transient failure of a random single asset for 30 min in the simulation, which is losing 3 update cycles in the DEKF system. From the simulation results, the position accuracy has been degraded to 4.84% which is better than the degraded localization performance of 11.5% from the permanent loss scenario among available assets. In conclusion, the autonomous Lunar PNT system based on the DEKF approach shows the ability to maintain resilience and robustness in the possible communication failure scenarios, ensuring that localization accuracy is preserved across various network degradation and outages. Future studies on investigating user localization performance near the South Pole and the broadcast network system will be continued in the following months.

Yeji Kim↗

DER Planning with Resilience Analysis Using REopt Lite: A Behind-the-Meter Techno-Economic Analysis Tool

REopt Lite is a techno-economic decision support model for behind-the-meter energy systems design and dispatch modeling. REopt Lite is used to optimize energy systems for buildings, campuses, communities, and microgrids. It is based on a Mixed Integer Linear Programming (MILP) optimization model. It is a fully automated and streamlined energy modeling tool that can be used off-the-shelf for a wide variety of distributed generation integration analyses and at the same time is architected to be extensible for user-specific customizations for advanced users and subject matter experts. It is publicly available as a webtool as well as has an Application Programming Interface (API). The API functionality enables programmatic access to the model facilitating smooth integration with other distribution systems modeling tools, and automated multiple scenarios/sensitivity studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Coordinated Optimization and Control of Residential Solid State Power Substations in Electrical Distribution Network

This paper proposes a computationally efficient mixed integer linear programming (MILP) model for the coordinated optimization of solid-state power substations (SSPSs) in a feeder considering the full unbalanced three-phase structure of the distribution grid and its characteristics. The proposed model determines the optimal real and reactive power of each SSPS at the point of common coupling (PCC) that minimizes the operating cost and maximizes the system performance, e.g., voltage regulation and phase balancing. To improve the computational efficiency, an inscribed octagon is introduced to approximate the quadratic capacity constraints of components. Numerical simulation results show the effectiveness of the proposed model and significant improvements in voltage profiles and power imbalance between phases.

Liu, Guodong↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources: Preprint

Integration of a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problem requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs) including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperformed other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Optimal operations of a nuclear-based integrated energy system: A mixed integer program approach

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.

08 HYDROGEN↗

Recycling Rare Earth Elements from End-of-Life Electric and Hybrid Electric Vehicle Motors

In this paper, we propose a superstructure-based approach to finding the optimal pathways for recovering rare earth elements in their commercialized rare earth oxide form from end-of-life EV and HEV motors. The proposed superstructure was modeled as a MILP optimization problem, selecting the net present value as the objective function. Whenever possible, costing data taken from the literature was used to inform this mode. However, due to the novelty of this research area data were often not available thus requiring the generation of flowsheets that were implemented in Aspen Plus.

Laliwala, Chris↗

Privacy-Protected Simultaneous Provision of Energy and Primary Frequency Control Reserve

This paper investigates a Mixed Integer Linear Programming (MILP) model for simultaneous scheduling of energy and primary frequency control reserve. Given the model’s unique structure and growing concerns about privacy, we adopt Dantzig-Wolfe Decomposition (DWD) algorithm to solve the problem in a decentralized fashion while obfuscating the privacy of the energy and reserve resources. Additionally, we present a novel criterion for checking the model’s feasibility. Finally, simulation results are given and discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗