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

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Demand Response Operation of Electricity-Intensive Chemical Processes for Reduced Greenhouse Gas Emissions: Application to an Air Separation Unit

A recent push for reduced greenhouse gas (GHG) emissions has led (in part) to the addition of renewable electricity generation sources to the power generation mix. Renewables such as wind and solar are desynchronized from grid demand, requiring the use of fossil fuels to bridge the gap. We propose a novel production scheduling formulation, emissions-minimizing production (EMP), which utilizes time-based information on the nature of the power generation mix to lower GHG emissions related to the transmission and generation of electricity for industrial users. We demonstrate the application of EMP on a single-column air separation unit. The scheduling problem is cast as a mixed integer linear program that can be solved in a practical amount of time. Extensive numerical studies are used to place EMP in the context of other production scheduling methods (such as demand response), and demonstrate its potential for significant reductions in GHG emissions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗

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↗

Secondary Voltage Control Via Demand-Side Energy Storage with Temporal Logic Specifications

This paper proposes a secondary voltage control method that can handle the temporal logic specifications (TLSs). The control objective is to schedule a control signal for energy storage system (ESS) such that the voltage variation of a defined critical bus satisfies TLSs. The TLS allows definitions of set and timing constraints at the same time, such as a finite-time restoration. A simplified analytical model is derived to describe the voltage variation of critical buses. Based on this model, a numerical optimal control problem is formulated as a mixed integer linear program to generate the proper control input for the ESS. The proposed control is verified on a lumped distribution system model. With this control diagram, supportive controllers can be easily designed to make voltage behaviors comply with grid codes and avoid unnecessary relay actions.

Zhang, Yichen↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

Co-Optimized Analysis and Design of Electric and Natural Gas Infrastructures

This paper proposes and implements a long-term deterministic capacity expansion model for the co-optimization of electric and natural gas infrastructures. It determines the required investments in generation units, transmission lines and pipelines for meeting future demands, while representing electricity and natural gas flows using DC Power Flow and Weymouth equations, respectively. A Mixed Integer Nonlinear Programming (MINLP) problem is developed, from which a linearized version is derived. A 26 node integrated gas-electric system for the Eastern Region of the United States is used to demonstrate the model’s capabilities. Results show that the model provides an accurate operational representation of the integrated system, and, therefore, enhances the expansion planning process.

47 OTHER INSTRUMENTATION↗

Resilient Distribution System Restoration with Equitable Load Shedding

A methodology is proposed for the improvement of electric distribution system resilience to high-impact, low-probability catastrophic events. An approach for dynamic network reconfiguration and coordination of distributed energy resources is introduced to assist in restoration efforts. The problem is formulated as a mixed-integer linear program that minimizes generation costs, the cost of lost load, and costs associated with equitable load shedding, while respecting operational limits of generation, loads, and the network. Constraints are imposed on binary switching variables to ensure equitable load shedding in emergency situations. Numerical validation of the proposed approach is conducted on an example distribution feeder, and case studies are performed to analyze the impact of various parameters in the optimization problem formulation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗

Solving the Unit Commitment Problem: Polyhedral Theory, Symmetry, and Power Flow

In this talk, I will give an overview of mixed integer linear programming (MILP) formulations and extensions thereof which enable the effective solution of the unit commitment problem (UC) when paired with a commercial MILP solver. First, we will place UC in context, stressing the importance of achieving a (near) optimal solution. Then we will discuss the importance of perfect and "good-enough" formulations for individual generators / market participants. Some of these formulations enable symmetry-aware reformulations for identical market participants, which can be critical when symmetry is present. Finally, we will discuss approximations of AC power flow currently used in practice, and the challenges with including these approximations within the UC formulation.

MATHEMATICS AND COMPUTING↗

Exploiting Identical Generators in Unit Commitment

Here, we present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves) into a single unit reduces redundancy in the search space induced by both exact symmetry (permutations of generator schedules) and certain classes of mutually non-dominated solutions. We study the impact of aggregation on two large-scale UC instances, one from the academic literature and another based on real-world operator data. Our computational tests demonstrate that when present, identical generators can negatively affect the performance of modern MILP solvers on UC formulations. Further, we show that our reformation of the UC MILP through aggregation is an effective method for mitigating this source of computational difficulty.

97 MATHEMATICS AND COMPUTING↗

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous- enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks: Preprint

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous–enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

Worst configurations (instantons) for compressed sensing over reals: a channel coding approach

We consider Linear Programming (LP) solution of a Compressed Sensing (CS) problem over reals, also known as the Basis Pursuit (BasP) algorithm. The BasP allows interpretation as a channel-coding problem, and it guarantees the error-free reconstruction over reals for properly chosen measurement matrix and sufficiently sparse error vectors. In this manuscript, we examine how the BasP performs on a given measurement matrix and develop a technique to discover sparse vectors for which the BasP fails. The resulting algorithm is a generalization of our previous results on finding the most probable error-patterns, so called instantons, degrading performance of a finite size Low-Density Parity-Check (LDPC) code in the error-floor regime. The BasP fails when its output is different from the actual error-pattern. We design CS-Instanton Search Algorithm (ISA) generating a sparse vector, called CS-instanton, such that the BasP fails on the instanton, while its action on any modification of the CS-instanton decreasing a properly defined norm is successful. We also prove that, given a sufficiently dense random input for the error-vector, the CS-ISA converges to an instanton in a small finite number of steps. Performance of the CS-ISA is tested on example of a randomly generated 512 * 120 matrix, that outputs the shortest instanton (error vector) pattern of length 11.

99 GENERAL AND MISCELLANEOUS↗

Conditions for the Solvability of the Linear Programming Formulation for Constrained Discounted Markov Decision Processes

We consider a discrete-time constrained discounted Markov decision process (MDP) with Borel state and action spaces, compact action sets, and lower semi-continuous cost functions. We introduce a set of hypotheses related to a positive weight function which allow us to consider cost functions that might not be bounded below by a constant, and which imply the solvability of the linear programming formulation of the constrained MDP. In particular, we establish the existence of a constrained optimal stationary policy. Our results are illustrated with an application to a fishery management problem.

97 MATHEMATICS AND COMPUTING↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

Optimal electric-distribution-grid planning considering the demand-side flexibility of thermal building systems for a test case in Singapore

The planning of district-scale electric grids, i.e., distribution grids, has traditionally relied on finding the most cost-effective design such that they are able to supply the peak loads in a district. With the advent of electric demand side flexibility (DSF), there is the opportunity to reshape peak loads such that the investment cost of the electric grid decreases in exchange for a minor increase in the operation cost. This paper formulates an optimal planning approach for the electric grid at the district scale, which incorporates the DSF from thermal building systems, e.g., heating ventilation and air-conditioning (HVAC) systems. The problem is formulated as a mixed-integer linear program (MILP) and aims at minimizing the investment cost for the grid along with the operation cost of the flexible loads. This is subjected to the fixed electricity demand and thermal comfort constraints of building occupants. To this end, linear models for the thermal comfort in the buildings and the power flow in electric grid are considered. The approach is tested on a district planning test case based in Singapore, where the results show up to 30.9 % reductions in investment cost and up to 3.7 % reduction in total annualized cost. Urban planning authorities, developers and utility companies can all benefit from the presented approach to make optimized investment decisions. For building operators, the results point to the need of adopting their control systems for DSF.

Troitzsch, Sebastian↗

A two-stage service restoration method for electric power distribution systems

Improving the reliability of power distribution systems is critically important for both utilities and customers. This calls for an efficient service restoration module within a distribution management system to support the implementation of self-healing smart grid networks. Although the emerging smart grid technologies, including distributed generators (DGs) and remote-controlled switches, enhance the self-healing capability and allow faster recovery, they still pose additional complexity to the service restoration problem, especially under cold load pickup (CLPU) conditions. Herein, a novel two-stage restoration framework is proposed to generate a restoration solutions with a sequence of control actions. The first stage generates a restoration plan that supports both the traditional service restoration using feeder reconfiguration and the grid-forming DG-assisted intentional islanding methods. The second stage generates an optimal sequence of switching operations to bring the outaged system quickly to the final restored configuration. The problem is formulated as a mixed-integer linear program that incorporates system connectivity, operating constraints, and the CLPU models. It is demonstrated that on using a multi-feeder test case, the proposed framework is effective in utilizing all available resources to quickly restore the service and generate an optimal sequence of switching actions to be used by the operator to reach the desired optimal configuration.

24 POWER TRANSMISSION AND DISTRIBUTION↗