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 91 records · Page 5

PMU and Communication Infrastructure Restoration for Post-Attack Observability Recovery of Power Grids

This paper is concerned about recovering the observability of cyber-physical power grids after massive cyber attacks, which helps to achieve the cyber-physical resilience of the grids. For recovering the observability of the grid, the measurability of the Phasor Measurement Units (PMUs) and the connectivity of the communication network are needed to be restored. The PMU and communication infrastructure restoration problem is jointly formulated as a Mixed Integer Linear Programming (MILP) problem to minimize the observability loss of the grid over time after a cyber attack while considering the constraint of limited resources. The efficacy of the proposed optimal restoration strategy is verified by comparing with heuristic methods on the IEEE 57-bus system.

cyber security↗

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

Positive Systems↗

An Algorithm for Constructing and Searching Spaces of Alternative Hypotheses

In this paper, we develop techniques for automated hypothesis-space exploration over data sets that may contain contradictions. To do so, we make use of the equivalence between two formulations: those of first-order predicate logic with prefix modal quantifiers under the finite-model hypothesis and those of mixed-integer linear programming (MILP) problems. Unlike other approaches, we do not assume that all logical assertions are true without doubt. Instead, we look for alternative hypotheses about the validity of the claims by identifying alternative optimal solutions to a corresponding MILP. We use a collection of slack variables in the derived linear constraints to indicate the presence of contradictory data or assumptions. The objective is to minimize contradictions between data and assertions represented by the presence of nonzero slack in the set of linear constraints. In this paper, we present the following: 1) a correspondence between first-order predicate logic with modal quantifier prefixes under the finite-model hypothesis and MILP problems and 2) an implicit enumeration algorithm for exploring the contradiction hypothesis space.

99 GENERAL AND MISCELLANEOUS↗

Joint Topology Identification and State Estimation in Unobservable Distribution Grids

Many distribution system operations (e.g., state estimation, control, fault detection/localization) rely on the assumption that the underlying topology is accurately defined. In general, topology identification is a challenging problem in distribution systems as these systems are unobservable with a very limited number of available measurements. In this paper, we tackle this problem by designing a compressive sensing framework that jointly estimates the systems states and network topology via an integrated mixed integer nonlinear program (MINLP) formulation. Here, two reformulations of the original MINLP problems are investigated. Firstly, in order to remove the nonlinearity in the MINLP formulation, a mixed integer linear programming (MILP) problem that employs auxiliary variables is derived. Furthermore, to achieve a faster solution, convex relaxation of the original formulation is derived. Finally, using a Markovian model for topology changes, prior information about system topology is used to improve topology identification particularly when a limited amount of measurements is available. Simulation results on IEEE 37-bus test feeder and IEEE 123-bus test feeder illustrate the efficiency and scalability of the proposed approaches from both state estimation and topology identification point of view (even with 30% of available data).

42 ENGINEERING↗

Comparison of open-source linear programming solvers.

When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.

Gearhart, Jared Lee↗

Optimal distribution system restoration using PHEVs

Power outages cost billions of dollars every year and jeopardise the lives of hospital patients. Traditionally, power distribution system takes a long time to recover after a major blackout, due to its top-down operation strategy. New technologies in modern distribution systems bring opportunities and challenges to distribution system restoration. As fast response energy resources, plug-in hybrid electric vehicles (PHEVs) can accelerate the load pickup by compensating the imbalance between available generation and distribution system load. This study provides a bottom-up restoration strategy to use PHEVs for reliable load pickup and faster restoration process. The optimisation problem of finding load pickup sequence to maximise restored energy is formulated as a mixed integer linear programming (MILP) problem. Moreover, the coordination between transmission and distribution restoration is developed to efficiently restore the entire system back to normal operating conditions. Simulation results on one 100-feeder test system demonstrate the efficiency of MILP-based restoration strategy and the benefit from PHEVs to restore more energy in given restoration time. The proposed restoration strategy has great potential to facilitate system operators to achieve efficient system restoration plans. It also provides incentives to deploy a large amount of PHEVs to improve system resiliency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A sequential linear optimization approach for controller design

A linear optimization approach with a simple real arithmetic algorithm is presented for reliable controller design and vibration suppression of flexible structures. Using first order sensitivity of the system eigenvalues with respect to the design parameters in conjunction with a continuation procedure, the method converts a nonlinear optimization problem into a maximization problem with linear inequality constraints. The method of linear programming is then applied to solve the converted linear optimization problem. The general efficiency of the linear programming approach allows the method to handle structural optimization problems with a large number of inequality constraints on the design vector. The method is demonstrated using a truss beam finite element model for the optimal sizing and placement of active/passive-structural members for damping augmentation. Results using both the sequential linear optimization approach and nonlinear optimization are presented and compared. The insensitivity to initial conditions of the linear optimization approach is also demonstrated.

Horta, L. G.↗

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↗

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↗

Determination of design and operation parameters for upper atmospheric research instrumentation to yield optimum resolution with deconvolution, appendix 4

The power spectrum for a stationary random process can be defined with the Wiener-Khintchine Theorem, which says that the power spectrum and the auto correlation function are a Fourier transform pair. To implement this theorem for signals that are discrete and of finite length we can use the Blackman-Tukey method. Blackman and Tukey (1958) show that a function w(tau), called a lag window, can be applied to the auto correlation estimates to obtain power spectrum estimates that are statistically stable. The Fourier transform of w(r) is called a spectral window. Typical choices for spectral windows show a distinct trade-off between the main lobe width and side lobe strength. A new idea for designing windows by taking linear combinations of the standard windows to produce hybrid windows was introduced by Smith (1985). We implement Smith's idea to obtain spectral windows with narrow main lobes and smaller (compared with typical windows) near side lobes. One of the main contributions of this thesis is that we show that Smith's problem is equivalent to a Quadratic Programming (QP) problem with linear equality and inequality constraints. A computer program was written to produce hybrid windows by setting up and solving the QP problem. We also developed and solved two variations of the original problem. The two variations involved changing the inequality constraints in both cases from non negativity on the combination coefficients to non negativity on the hybrid lag window itself. For the second variation, the window functions used to construct the hybrid window were changed to a frequency-variable set of truncated cosinusoids. A series of tests was run with the three computer programs to investigate the behavior of the hybrid spectral and lag windows. Emphasis was put on obtaining spectral windows with both relatively narrow main lobes and the lowest possible (for these algorithms) near side lobes. Some success was achieved for this goal. A 10 dB peak side lobe reduction over the rectangular spectral window without significant main lobe broadening was achieved. Also, average side lobe levels of -117 dB were reached at a cost of doubling the main lobe width (at the -3 dB point).

Ioup, George E.↗

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↗

Sensitivity Analysis of Linear Programming and Quadratic Programming Algorithms for Control Allocation

The Next Generation (NextGen) transport aircraft configurations being investigated as part of the NASA Aeronautics Subsonic Fixed Wing Project have more control surfaces, or control effectors, than existing transport aircraft configurations. Conventional flight control is achieved through two symmetric elevators, two antisymmetric ailerons, and a rudder. The five effectors, reduced to three command variables, produce moments along the three main axes of the aircraft and enable the pilot to control the attitude and flight path of the aircraft. The NextGen aircraft will have additional redundant control effectors to control the three moments, creating a situation where the aircraft is over-actuated and where a simple relationship does not exist anymore between the required effector deflections and the desired moments. NextGen flight controllers will incorporate control allocation algorithms to determine the optimal effector commands and attain the desired moments, taking into account the effector limits. Approaches to solving the problem using linear programming and quadratic programming algorithms have been proposed and tested. It is of great interest to understand their relative advantages and disadvantages and how design parameters may affect their properties. In this paper, we investigate the sensitivity of the effector commands with respect to the desired moments and show on some examples that the solutions provided using the l2 norm of quadratic programming are less sensitive than those using the l1 norm of linear programming.

Frost, Susan A.↗

On extreme points of the diffusion polytope

Here, we consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors attainable using finite sequences of these operations. A number of physical problems have linear programming solutions taking the diffusion polytope as the feasible region, e.g. the free energy that can be removed from plasma using waves, so there is a need to describe and enumerate its extreme points. We also review known results for the case of the complete graph Kn, and study a variety of problems for the path graph Pn and the cyclic graph Cn. Finall, we describe the different kinds of extreme points that arise, and identify the diffusion polytope in a number of simple cases. In the case of increasing initial populations on Pn the diffusion polytope is topologically an n-dimensional hypercube.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Algorithm for Constructing and Searching Spaces of Alternative Hypotheses

In this paper we develop techniques for automated hypothesis generation over data sets that maycontain contradictions. To do so, we make use of the equivalence between two formulations: those offirst order predicate logic with prefix modal quantifiers under the finite model hypothesis and those ofMixed Integer Linear Programming (MILP) problems. The equivalence between integer programming and logical satisfiability has been known since Karp'sseminal work in NP-completeness. Other authors have made use of this equivalence to explore efficientmethods of solving the satisfiability problem in the propositional calculus for specific problem types.The work presented here differentiates itself from previous work in that we do not assume that alllogical assertions are true without doubt. Instead we look for alternative hypotheses about the validityof the claims by identifying alternative optimal solutions to a corresponding MILP. We use a collectionof slack variables in the derived linear constraints to indicate the presence of contradictory data orassumptions. The objective is to minimize contradictions between data and assertions represented bythe presence of non-zero slack in the set of linear constraints.

99 GENERAL AND MISCELLANEOUS↗

An MILP-Based Distributed Energy Management for Coordination of Networked Microgrids

An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗

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↗