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 379 records · Page 21

Bidding strategy for microgrid in day-ahead market based on hybrid stochastic/robust optimization

In this paper, we propose an optimal bidding strategy in the day-ahead market of a microgrid consisting of intermittent distributed generation (DG), storage, dispatchable DG and price responsive loads. The microgrid coordinates the energy consumption or production of its components and trades electricity in both the day-ahead and real-time markets to minimize its operating cost as a single entity. The bidding problem is challenging due to a variety of uncertainties, including power output of intermittent DG, load variation, day-ahead and real-time market prices. A hybrid stochastic/robust optimization model is proposed to minimize the expected net cost, i.e., expected total cost of operation minus total benefit of demand. This formulation can be solved by mixed integer linear programming. The uncertain output of intermittent DG and day-ahead market price are modeled via scenarios based on forecast results, while a robust optimization is proposed to limit the unbalanced power in real-time market taking account of the uncertainty of real-time market price. Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator, a battery and a responsive load show the advantage of stochastic optimization in addition to robust optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Bi-Level Dynamic Optimization with Feedback

This paper considers a bi-level real-time algorithmic framework for networked systems, consisting of several local controllers and a central controller. The central controller issues setpoints to the local controllers to optimize their operational objectives while satisfying system-wide constraints. In this context, the paper develops an online algorithm for tracking the optimal solution of the underlying dynamic optimization problem. The design of the algorithm is based on a projected-gradient method, suitably modified to accommodate appropriate measurements (i.e., feedback). Optimality claims are established in terms of the dynamic regret of the algorithm; the latter is a natural performance criterion in nonstationary environments associated with real-time control problems. Finally, the application of the algorithm to real-time control of power setpoints in an electrical grid is illustrated.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Semidefinite programming algorithm for the quantum mechanical bootstrap

Here, we present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

97 MATHEMATICS AND COMPUTING↗

3-D Deep Penetration Neutron Imaging of Thick Absorgin and Diffusive Objects Using Transport Theory

A current area of research interest in national security is to effectively and efficiently determine the contents of the many shipping containers that enter ports in the United States. This interest comes as a result of the 9/11 Commission Act passed by Congress in 2007 that requires 100% of inbound cargo to be scanned by 2012. It appears that this requirement will be achieved by 2012, but as of February of 2009 eighty percent of the 11.5 million inbound cargo containers were being scanned. The systems used today in all major U.S. ports to determine the presence of radioactive material within cargo containers are Radiation Portal Monitors (RPM). These devices generally exist in the form of a gate or series of gates that the containers can be driven through and scanned. The monitors are effective for determining the presence of radiation, but offer little more information about the particular source. This simple pass-fail system leads to many false alarms as many everyday items emit radiation including smoke detectors due to the Americium-241 source contained inside, bananas, milk, cocoa powder and lean beef due to the trace amounts of Potassium-40, and fire brick and kitty litter due to their high clay content which often contains traces of uranium and thorium. In addition, if an illuminating source is imposed on the boundary of the container, the contents of the container may become activated. These materials include steel, aluminum and many agricultural products. Current portal monitors also have not proven to be that effective at identifying natural or highly enriched uranium (HEU). In fact, the best available Advanced Spectroscopic Portal Monitors (ASP) are only capable of identifying bare HEU 70-88% of the time and masked HEU and depleted uranium (DU) only 53 percent of the time. Therefore, a better algorithm that uses more information collected from better detectors about the specific material distribution within the container is desired. The work reported here explores the inverse problem of optical tomography applied to heterogeneous domains. The neutral particle transport equation was used as the forward model for how neutral particles stream through and interact within these heterogeneous domains. A constrained optimization technique that uses Newtons method served as the basis of the inverse problem. Optical tomography aims at reconstructing the material properties using (a) illuminating sources and (b) detector readings. However, accurate simulations for radiation transport require that the particle (gamma and/or neutron) energy be appropriate discretize in the multigroup approximation. This, in turns, yields optical tomography problems where the number of unknowns grows (1) about quadratically with respect to the number of energy groups, G, (notably to reconstruct the scattering matrix) and (2) linearly with respect to the number of unknown material regions. As pointed out, a promising approach could rely on algorithms to appropriately select a material type per material zone rather than G2 values. This approach, though promising, still requires further investigation: (a) when switching from cross-section values unknowns to material type indices (discrete integer unknowns), integer programming techniques are needed since derivative information is no longer available; and (b) the issue of selecting the initial material zoning remains. The work reported here proposes an approach to solve the latter item, whereby a material zoning is proposed using one-group or few-groups transport approximations. The capabilities and limitations of the presented method were explored; they are briefly summarized next and later described in fuller details in the Appendices. The major factors that influenced the ability of the optimization method to reconstruct the cross sections of these domains included the locations of the sources used to illuminate the domains, the number of separate experiments used in the reconstruction, the locations where measurements were collected, the optical thickness of the domain, the amount of signal noise and signal bias applied to the measurements and the initial guess for the cross section distribution. All of these factors were explored for problems with and without scattering. Increasing the number of source and measurement locations and experiments generally was more successful at reconstructing optically thicker domains while producing less error in the image. The maximum optical thickness that could be reconstructed with this method was ten mean free paths for pure absorber and two mean free paths for scattering problems. Applying signal noise and signal bias to the measured fluxes produced more error in the produced image. Generally, Newtons method was more successful at reconstructing domains from an initial guess for the cross sections that was greater in magnitude than their true values than from an initial guess that was lower in magnitude.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

Max-Plus Stochastic Control and Risk-Sensitivity

In the Maslov idempotent probability calculus, expectations of random variables are defined so as to be linear with respect to max-plus addition and scalar multiplication. This paper considers control problems in which the objective is to minimize the max-plus expectation of some max-plus additive running cost. Such problems arise naturally as limits of some types of risk sensitive stochastic control problems. The value function is a viscosity solution to a quasivariational inequality (QVI) of dynamic programming. Equivalence of this QVI to a nonlinear parabolic PDE with discontinuous Hamiltonian is used to prove a comparison theorem for viscosity sub- and super-solutions. An example from mathematical finance is given, and an application in nonlinear H-infinity control is sketched.

97 MATHEMATICS AND COMPUTING↗

Performance Evaluation of District Energy Microgrids Planning Tool for Non-Technical Users

Community Microgrids are increasingly gaining popularity worldwide for their efficiency, cost-effectiveness, and local resilience improvement. Microgrid planning tools play a crucial role in their deployment. In the process, tentative designs of the microgrid are simulated, analyzed, and optimized. Due to the complexity of the problem, planning tools must carefully balance computational efficiency while seeking the most optimal solutions. This paper investigates the impact of algorithm selection on CPU and memory utilization of a Community Microgrid planning tool that is specifically designed for non-technical users. We compare two version of the code with two alternatives for Community Microgrid planning tools: a Greedy Algorithm, and a Linear Programming Approach. This comparison examines scenarios spanning from 2 to 50 buildings. Our findings revealed a significant difference in performance between the two algorithms, underscoring the critical role of algorithm selection in optimizing the efficiency of Community Microgrid Planning Tools.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Accelerating DCA++ (Dynamical Cluster Approximation) Scientific Application on the Summit supercomputer

Optimizing scientific applications on today’s accelerator-based high performance computing systems can be challenging, especially when multiple GPUs and CPUs with heterogeneous memories and persistent non-volatile memories are present. An example is Summit, an accelerator-based system at the Oak Ridge Leadership Computing Facility (OLCF) that is rated as the world’s fastest supercomputer to-date. New strategies are thus needed to expose the parallelism in legacy applications, while being amenable to efficient mapping to the underlying architecture.In this paper we discuss our experiences and strategies to port a scientific application, DCA++, to Summit. DCA++ is a highperformance research application that solves quantum manybody problems with a cutting edge quantum cluster algorithm, the dynamical cluster approximation.Our strategies aim to synergize the strengths of the different programming models in the code. These include: (a) streamlining the interactions between the CPU threads and the GPUs, (b) implementing computing kernels on the GPUs and decreasing CPU-GPU memory transfers, (c) allowing asynchronous GPU communications, and (d) increasing compute intensity by combining linear algebraic operations.Full-scale production runs using all 4600 Summit nodes attained a peak performance of 73.5 PFLOPS with a mixed precision implementation.We observed a perfect strong and weak scaling for the quantum Monte Carlo solver in DCA++, while encountering about 2× input/output (I/O) and MPI communication overhead on the time-to-solution for the full machine run. Our hardware agnostic optimizations are designed to alleviate the communication and I/O challenges observed, while improving the compute intensity and obtaining optimal performance on a complex, hybrid architecture like Summit.

Balduzzi, Giovanni↗

Assessment of PCMI Simulation Using the Multidimensional Multiphysics BISON Fuel Performance Code

Since 2008, the Idaho National Laboratory (INL) has been developing a next-generation nuclear fuel performance code called BISON. BISON is built using INL’s Multiphysics Object-Oriented Simulation Environment, or MOOSE. MOOSE is a massively parallel, finite element-based framework to solve systems of coupled non-linear partial differential equations using the Jacobian-FreeNewton Krylov (JFNK) method. MOOSE supports the use of complex two- and three-dimensional meshes and uses implicit time integration, which is important for the widely varied time scales in nuclear fuel simulation. MOOSE’s object-oriented architecture minimizes the programming required to add new physics models. BISON has been applied to various nuclear fuel problems to assess the accuracy of its 2D and 3D capabilities. The benchmark results used in this assessment range from simulation results from other fuel performance codes to measurements from well-known and documented reactor experiments. An example of a well-documented experiment used in this assessment is the Third Risø Fission Gas Project, referred to as “Bump Test GE7”, which was performed on rod ZX115. This experiment was chosen because it allows for an evaluation of several aspects of the code, including fully coupled thermo-mechanics, contact, and several nonlinear material models. Bump Test GE7 consists of a base-irradiation period of a full-length rod in the Quad-Cities-1 BWR for nearly 7 years to a burnup of 4.17% FIMA. The base irradiation test is followed by a “bump test” of a sub-section of the original rod. The bump test takes place in the test reactor DR3 at Risø in a water-cooled HP1 rig under BWR conditions where the power level is increased by about 50% over base irradiation levels in the span of several hours. During base irradiation, the axial power profile is flat. During the bump test, the axial power profile changes so that the bottom half of the rod is at approximately 50% higher power than at the base irradiation level, while the power at the top of the rod is at about 20% of the base irradiation power level. 2D BISON simulations of the Bump Test GE7 were run using both discrete and smeared pellet geometry. Comparisons between these calculations and experimental measurements are presented for clad diameter and elongation after the base irradiation and clad profile along the length of the test section after the bump test. Preliminary comparisons between calculations and measurements are favorable, supporting the use of BISON as an accurate multiphysics fuel simulation tool.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

SU-E-T-234: Modulated Photon Radiotherapy (XMRT):The Impact of Incorporating Energy Modulation Into Intensity Modulated Radiotherapy (IMRT) Optimization

Purpose: To develop a new radiotherapy plan optimization technique that, for a given organ geometry, will find the optimal photon beam energies and fluences to produce a desirable dose distribution. This new modulated (both in energy and fluence) photon radiotherapy (XMRT) was compared with intensity modulated radiotherapy (IMRT) for a simple organ geometry. Methods: The XMRT optimization was formulated using a linear programming approach where the objective function is the mean dose to the healthy organs and dose-point constraints were assigned to each organ of interest. The organ geometry consisted of a target, two organs at risk (OARs), and normal tissue. A seven-equispaced-coplanar beam arrangement was used. For conventional IMRT, only 6 MV beams were available, while XMRT was optimized using 6 and 18 MV beams. A prescribed dose (PD) of 72 GY was assigned to the target, with upper and lower bounds of 110% and 95% of the PD, respectively. Both OARs were assigned a maximum dose of 64 Gy, while the normal tissue was assigned a maximum dose of 66 Gy. A numerical solver, Gurobi, generated solutions for the XMRT and IMRT problems. The dose-volume histograms from IMRT and XMRT solutions were compared. Results: The maximum, minimum, mean, and homogeneity of the dose to the target were comparable between IMRT and XMRT. Though IMRT had improved dose conformity relative to XMRT, XMRT reduced the mean dose to both OARs by more than 1 Gy. For normal tissue, an increase of 5 Gy in mean dose and 27 percent in integral dose was seen for IMRT relative to XMRT. Conclusion: This work demonstrates the benefits of simultaneously modulating photon beam energy and fluence using our XMRT approach in a given phantom geometry. While target coverage was comparable, dose to healthy structures was reduced using XMRT.

07 ISOTOPE AND RADIATION SOURCES↗

On Mixed Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed integer programming formulations for the unit commitment problem (UC). UC formulations have been an especially active area of research over the past twelve years, due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both production upper bound and piecewise linear produc- tion costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved – and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

An (R, S)-norm fuzzy information measure with its applications in multiple-attribute decision-making

In this paper, we introduce a quantity measure which is called (R, S)-norm entropy and discuss some of its major properties with Shannon’s and other entropies in the literature. Based on this (R, S)-norm entropy, we have proposed a new (R, S)-norm fuzzy information measure and discussed its validity and properties. Further, we have given its comparison with other fuzzy information measures to prove its effectiveness. Attribute weights play an important role in multiple-attribute decision-making problems. In the present communication, two methods of determining the attribute weights are introduced. First is the case when the information regarding attribute weights is incompletely known or completely unknown and second is when we have partial information about attribute weights. For the first case, the extension of ordinary entropy weight method is used to calculate attribute weights and minimum entropy principle method based on solving a linear programming model is used in the second case. Finally, two methods are explained through numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PETSc Users Manual (Rev. 3.13)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear solvers, nonlinear solvers, and time integrators that may be used in application codes written in Fortran, C, C++, and Python. PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than \rolling them" yourself.

97 MATHEMATICS AND COMPUTING↗

Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach

In this paper, we present a multi-objective solution of the Pareto front for a certain class of discrete-time ergodic controllable Markov chains. For solving the problem, we transform the original multi-objective problem into an equivalent nonlinear programming problem implementing the Lagrange principle. We then propose to adopt the Tikhonov’s regularization method to ensure the convergence of the cost functions to a unique point into the Pareto front. We show that Pareto policies are characterized as optimal policies. One of the fundamental problems related to the construction of the Pareto front is the existence and characterization of both, Pareto and strong Pareto policies. By introducing the Tikhonov’s regularizator, we ensure the existence of strong Pareto policies. This paper proposes a real solution to this problem. We formulate the original problem considering several constraints: (a) we employ the c-variable method for the introduction of linear constraints over the nonlinear problem and (b) restrict the cost functions, allowing points in the Pareto front to have a small distance from one another. The constraints imposed by the c-variable method make the problem computationally tractable and the restriction imposed by the small distance change ensures the continuation of the Pareto front. The resulting equation in this nonlinear system is an optimization problem for which the necessary and efficient condition of a minimum is solved using the projected gradient method. Moreover, we also prove the convergence conditions and compute the estimate rate of convergence of variables corresponding to the Lagrange principle and the Tikhonov’s regularization, respectively. We provide all the details needed to implement the proposed method in an efficient way. The usefulness of the method is successfully demonstrated by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks

Here, we consider underwater multi-modal wireless sensor networks (UWSNs) suitable for applications on submarine surveillance and monitoring, where nodes offload data to a mobile autonomous underwater vehicle (AUV) via optical technology, and coordinate using acoustic communication. Sensed data are associated with a value, decaying in time. In this scenario, we address the problem of finding the path of the AUV so that the Value of Information (VoI) of the data delivered to a sink on the surface is maximized. We define a Greedy and Adaptive AUV Path-finding (GAAP) heuristic that drives the AUV to collect data from nodes depending on the VoI of their data. For benchmarking the performance of AUV path-finding heuristics, we define an integer linear programming (ILP) formulation that accurately models the considered scenario, deriving a path that drives the AUV to collect and deliver data with the maximum VoI. In our experiments GAAP consistently delivers more than 80 percent of the theoretical maximum VoI determined by the ILP model. We also compare the performance of GAAP with that of other strategies for driving the AUV among sensing nodes, namely, random paths, TSP-based paths and a “lawn mower”-like strategy. Our results show that GAAP always outperforms every other heuristic in terms of delivered VoI, also obtaining higher energy efficiency.

47 OTHER INSTRUMENTATION↗

Challenges in Tracking Waste Reduction Performance Improvement in Manufacturing Plants

The recently released Circularity Gap Report 2023 by the Circle Economy Foundation states that the circularity score for the global economy is declining. The US Environmental Protection Agency (EPA) tracked municipal solid waste from 1960 to 2018 and found that 50% of the waste was destined for landfills. EPA estimates that US industry is responsible for 2.7 Gt of solid nonhazardous waste annually in the US mostly linear economy model. The circular economy framework aims to decouple economic value generation from the extraction of virgin materials from nature. The linear model of material extraction and disposal at the end of life is highly unsustainable. Manufacturing companies are adopting ambitious waste reduction targets to achieve sustainability. Through the Better Plants program, US DOE has established the Waste Reduction Network, which offers technical assistance to partners to achieve their ambitious waste reduction goals. Basic requirements of establishing a target include identifying a baseline, quantifying waste performance, and measuring progress over time. One problem faced by industry is unstandardized metrics for quantifying waste performance that may not be well suited to demonstrate progress. This paper studies traditional methods used to measure waste performance and highlights advantages, disadvantages, and limitations of each method. It also examines the suitability of applying the methods in different manufacturing circumstances. Finally, the paper presents a case study of a large manufacturer that faced inconsistencies in its tracked measurement metric. A solution was proposed and implemented to alter the methodology to enable more accurate waste performance tracking against a baseline.

circular economy↗

Polyhedral approximation in mixed-integer convex optimization

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.

97 MATHEMATICS AND COMPUTING↗

A tri-level distribution locational marginal price-based demand response framework

Here, in this paper, we propose a tri-level, nested, two-stage price-based demand response (PBDR) framework that considers distribution locational marginal price (DLMP) as DR enabler between load-serving entities (LSE), demand response providers (DRPs), and customers in the day-ahead distribution market. It enables LSE and customer interactions by using multiple DRPs, positioned in-between, and independently optimizes their objectives. The problem is formulated using linear power flow with approximated power losses and its application in DLMP as DR pricing. The tri-level problem is solved using a nested reformulation & decomposition (R&D) method and tested on the real Indian-108 bus distribution system under various dynamic pricings. Further, the temporal–spatial variations in DLMPs are assessed using fairness criteria. Numerical analyses demonstrate that DLMP applications can effectively improve economic efficiency, and transparency in DR programs valuation with a favorable fairness margin. The results show that DLMP as DR pricing signal induces (0-2) % variation in DLMP for DR participation up to 10 %. Further, it gives over 90 % fairness over temporal–spatial variation for all the customers.

24 POWER TRANSMISSION AND DISTRIBUTION↗