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 307 records · Page 17

Dispatch optimization of electric thermal energy storage within System Advisor Model

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

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Model Implementation (PART 1)

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

25 ENERGY STORAGE↗

An inertia-free filter line-search algorithm for large-scale nonlinear programming

We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.

Chiang, Nai-Yuan↗

A Model Predictive Control Based Generator Start-Up Optimization Strategy for Restoration With Microgrids as Black-Start Resources

Microgrids (MGs) can operate in an islanded mode and serve as black-start resources for power system restoration (PSR). Here, a model predictive control (MPC) based generator start-up optimization strategy for PSR is proposed utilizing MGs as black-start resources. First, the generator start-up sequence (GSUS) optimization is formulated as a mixed integer linear programming. Then, the uncertainties of MG black-start resources (MBSRs) are modeled by discretizing the probability distribution of the forecast errors, and representative scenarios for MBSRs extracted by formulating the probability mass transportation problem. Third, the generator start-up optimization strategy considering MBSRs is proposed utilizing the MPC technique, in which the optimization objective is to maximize the energy capability of the power systems and minimize the load curtailment of the MGs in each looking-ahead interval. Simulations on the IEEE 118 bus system with MGs and Zhejiang provincial power system in China verify that the introduced strategy for PSR can successfully restore the power system and effectively determine the optimal GSUS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic Design Optimization of Microstructural Features Using Linear Programming for Robust Design

Microstructure design can have a substantial effect on the performance of critical components in numerous aerospace applications. However, the stochastic nature of metallic microstructures leads to deviations in material properties from the design point and alters the performance of these critical components. In this paper, a novel stochastic linear programming (LP) methodology is developed for microstructure design accounting for uncertainties in desired properties. The metallic microstructure is represented using a finite element discretized form of the orientation distribution function (ODF). The inverse LP problem solves the mean values and covariance matrix of the ODFs to maximize the mean values of a property, given the statistical constraints on other properties. The highlight is an analytical uncertainty quantification model via a Gaussian distribution to model propagation of microstructural uncertainties to the properties. Examples illustrate maximization of the yield strength and magnetostriction of a galfenol alloy when constrained by uncertainties in a set of stiffness constants.

42 ENGINEERING↗

A modified homotopy method for solving the principal-agent bilevel programming problem

In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.

97 MATHEMATICS AND COMPUTING↗

Near-Optimal Solutions for Day-Ahead Unit Commitment

Given the difficulty and the time pressure of solving unit commitment problems, near -optimal solutions (those with 0.1 or 0.001% optimality gaps) are often used in practice. The choice in which of the near -optimal solutions is used, however, is random. We investigate the impact of solution choice on the revenues obtained by generator owners across a variety of pricing schemes and problem instances.

market-clearing↗

WE-AB-207B-11: Optimizing Tumor Control Probability in Radiation Therapy Treatment - Application to HDR Cervical Cancer

Purpose: The ultimate goal of radiotherapy treatment planning is to find a treatment that will yield a high tumor-control-probability(TCP) with an acceptable normal-tissue-complication probability(NTCP). Yet most treatment planning today is not based upon optimization of TCPs and NTCPs, but rather upon meeting physical dose and volume constraints defined by the planner. We design treatment plans that optimize TCP directly and contrast them with the clinical dose-based plans. PET image is incorporated to evaluate gain in TCP for dose escalation. Methods: We build a nonlinear mixed integer programming optimization model that maximizes TCP directly while satisfying the dose requirements on the targeted organ and healthy tissues. The solution strategy first fits the TCP function with a piecewise-linear approximation, then solves the problem that maximizes the piecewise linear approximation of TCP, and finally performs a local neighborhood search to improve the TCP value. To gauge the feasibility, characteristics, and potential benefit of PET-image guided dose escalation, initial validation consists of fifteen cervical cancer HDR patient cases. These patients have all received prior 45Gy of external radiation dose. For both escalated strategies, we consider 35Gy PTV-dose, and two variations (37Gy-boost to BTV vs 40Gy-boost) to PET-image-pockets. Results: TCP for standard clinical plans range from 59.4% - 63.6%. TCP for dose-based PET-guided escalated-dose-plan ranges from 63.8%–98.6% for all patients; whereas TCP-optimized plans achieves over 91% for all patients. There is marginal difference in TCP among those with 37Gy-boosted vs 40Gy-boosted. There is no increase in rectum and bladder dose among all plans. Conclusion: Optimizing TCP directly results in highly conformed treatment plans. The TCP-optimized plan is individualized based on the biological PET-image of the patients. The TCP-optimization framework is generalizable and has been applied successfully to other external-beam delivery modalities. A clinical trial is on-going to gauge the clinical significance. Partially supported by the National Science Foundation.

60 APPLIED LIFE SCIENCES↗

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗

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↗

Adiabatic Quantum Programming: Minor Embedding With Hard Faults

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

graph theory↗

ORNL Neutron Cross-Section Measurements in the Resolved Resonance Range for the NCSP

Nuclear criticality simulations test the quality and the consistency of the existing nuclear evaluated data libraries such as ENDF/B, JEFF, or JENDL. In some cases, the cross-section evaluations of those libraries are found insufficient to describe accurately criticality benchmarks. The US Nuclear Criticality Safety Program (NCSP) collaborates with the Joint Research Center (JRC) in Geel, Belgium, to perform high-resolution neutron-induced cross section measurements at the Geel Linear Accelerator (GELINA) to resolve deficiencies in nuclear data that have been emerging in criticality calculations. Problems with nuclear data include insufficient neutron energy range, missing covariances, and problems with previous experiments. For example, the use of the ENDF/B-VII.1 neutron cross section data for vanadium, cerium and zirconium in nuclear criticality safety calculations shows discrepancies between benchmark calculations measurements and demonstrates the need for reliable covariance data. For new covariances of existing data, a reevaluation of the old cross section data is needed. However, these data are in many cases no longer available. This deficit can be overcome only by obtaining new experimental data to serve as the basis of a new evaluation. Recent measurements were made of the neutron total and capture cross sections of natural vanadium and natural zirconium in the neutron energy range from 100 eV to several hundred keV. These measured data will be used to improve representation of the cross sections since most of the available evaluated data rely on old measurements.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Mixed-Integer Linear Programming Formulation with Embedded Machine Learning Surrogates for the Design of Chemical Process Families

In previous work, we introduced process family design. The main idea is to design a platform of common elements, and, allowing us to capture additional cost savings, simultaneously design a family of processes, and reducing both engineering and deployment timelines. We formulate this as an optimization problem, specifically a nonlinear generalized disjunctive program (GDP). We have proposed two approaches for reformulating and solving this problem: one based on full-discretization of the design space and one that uses Machine Learning (ML) surrogates to replace the nonlinear process models. Using ML surrogates to predict required system costs and performance indicators allows us to reformulate the nonlinearities in the GDP generate an efficient MILP formulation. In this work, we apply the ML surrogate approach to two case studies. One case study involves designing a family of carbon capture systems to cover a set of different flue gas flow rates and inlet CO 2 concentrations, where we consider the absorber and stripper as common unit module types. The second case study focuses on a water-desalination process, where we design a family of these processes for a variety of salt concentrations and flow rates. In both of these case studies, we demonstrate a scalable optimization approach that enables the design of multiple processes simultaneously, reducing the time-to-market and overall costs by maximizing the cost savings due to both economies of scale and economies of numbers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FemtoMAX – an X-ray beamline for structural dynamics at the short-pulse facility of MAX IV

The FemtoMAX beamline facilitates studies of the structural dynamics of materials. Such studies are of fundamental importance for key scientific problems related to programming materials using light, enabling new storage media and new manufacturing techniques, obtaining sustainable energy by mimicking photosynthesis, and gleaning insights into chemical and biological functional dynamics. The FemtoMAX beamline utilizes the MAX IV linear accelerator as an electron source. The photon bursts have a pulse length of 100 fs, which is on the timescale of molecular vibrations, and have wavelengths matching interatomic distances (Å). The uniqueness of the beamline has called for special beamline components. This paper presents the beamline design including ultrasensitive X-ray beam-position monitors based on thin Ce:YAG screens, efficient harmonic separators and novel timing tools.

laser↗

Large-scale parallel multibody dynamics with frictional contact on the GPU.

In the context of simulating the frictional contact dynamics of large systems of rigid bodies, this paper reviews a novel method for solving large cone complementarity problems by means of a fixed-point iteration algorithm. The method is an extension of the Gauss-Seidel and Gauss-Jacobi methods with over-relaxation for symmetric convex linear complementarity problems. Convergent under fairly standard assumptions, the method is implemented in a parallel framework by using a single instruction multiple data computation paradigm promoted by the Compute Unified Device Architecture library for graphical processing unit programming. The framework supports the simulation of problems with more than one million bodies in contact. Simulation thus becomes a viable tool for investigating the dynamics of complex systems such as ground vehicles running on sand, powder composites, and granular material flow.

99 GENERAL AND MISCELLANEOUS↗

Do genome-scale models need exact solvers or clearer standards?

Constraint-based analysis of genome-scale models (GEMs) arose shortly after the first genome sequences became available. As numerous reviews of the field show, this approach and methodology has proven to be successful in studying a wide range of biological phenomena (McCloskey et al, 2013; Bordbar et al, 2014). However, efforts to expand the user base are impeded by hurdles in correctly formulating these problems to obtain numerical solutions. In particular, in a study entitled “An exact arithmetic toolbox for a consistent and reproducible structural analysis of metabolic network models” (Chindelevitch et al, 2014), the authors apply an exact solver to 88 genome-scale constraint-based models of metabolism. The authors claim that COBRA calculations (Orth et al, 2010) are inconsistent with their results and that many published and actively used (Lee et al, 2007; McCloskey et al, 2013) genome-scale models do support cellular growth in existing studies only because of numerical errors. They base these broad claims on two observations: (i) three reconstructions ( i AF1260, i IT341, and i NJ661) compute feasibly in COBRA, but are infeasible when exact numerical algorithms are used by their software (entitled MONGOOSE); (ii) linear programs generated by MONGOOSE for i IT341 were submitted to the NEOS Server (a Web site that runs linear programs through various solvers) and gave inconsistent results. They further claim that a large percentage of these COBRA models are actually unable to produce biomass flux. Here, we demonstrate that the claims made by Chindelevitch et al (2014) stem from an incorrect parsing of models from files rather than actual problems with numerical error or COBRA computations.

59 BASIC BIOLOGICAL SCIENCES↗

A Mixed integer linear programming‐based distributed energy management for networked microgrids considering network operational objectives and constraints

Abstract Mixed integer linear programming (MILP)–based distributed energy management for networked microgrids embedded modern distribution systems is proposed. Considering the diverse ownership of microgrids, distributed energy resources (DERs) that interface directly with utilities and responsive loads, an alternating direction method of multipliers–based distributed framework was formulated for the scheduling of networked microgrids embedded modern distribution systems by adjusting nodal price signals iteratively. In addition, to make the formulated optimization problems resolvable through more accessible and popular MILP solvers, different linearisation techniques were employed to transform the nonlinear terms into linear or mixed integer linear formats. The proposed MILP‐based distributed method preserves all participants' autonomy (e.g., microgrids, DERs that interface directly with utilities and responsive loads), while incentivising them to actively participate in the distribution system operation with price signals. The proposed method is validated with results of numerical simulation using a modern distribution system consisting of multiple networked microgrids, DERs that interface directly with utilities, as well as responsive loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗