Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear 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 37 records · Page 2

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem that requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.

47 OTHER INSTRUMENTATION↗

A VSM-Based DER Dispatch MINLP for Volt-VAR Control in Unbalanced Power Distribution Systems

This paper presents an optimal dispatch algorithm to coordinate customer-owned controllable loads and smart solar inverters with utility-owned voltage regulators and capacitors to meet voltage control objectives. The optimization problem is formulated as a mixed-integer nonlinear programming (MINLP) problem. A voltage sensitivity matrix (VSM) is used to linearize the effect of control actions on the voltage at customer nodes when solving the MINLP. The VSM is recalculated at each time step to improve the computational accuracy. Both discrete switching actions of the capacitor and VRs and the continuous adjustment of real and reactive power from load and smart inverters are considered in the MINLP volt-var problem formulation. The objective function minimizes the cost of all control actions and the magnitude of voltage fluctuations from the previous time period. Constraints ensure that the voltage at each node is maintained within ANSI limits and the feeder power factor is controlled within the desired range. The algorithm is tested using an actual 3-phase unbalanced distribution feeder model. Simulation results demonstrate that the proposed algorithm is computationally feasible on real circuits and improves voltage control while minimizing operational costs.

McEntee, Catie↗

Optimization strategies for the vulnerability analysis of the electric power grid.

Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerability analysis can be studied as a mixed integer nonlinear programming (minlp) problem. Our analysis reveals a special structure in the formulation that can be exploited to avoid nonlinearity and approximate the original problem as a pure combinatorial problem. The key new observation behind our analysis is the correspondence between the Jacobian matrix (a representation of the feasibility boundary of the equations that describe the flow of power in the network) and the Laplacian matrix in spectral graph theory (a representation of the graph of the power grid). The reduced combinatorial problem is known as the network inhibition problem, for which we present a mixed integer linear programming formulation. Our experiments on benchmark power grids show that the reduced combinatorial model provides an accurate approximation, to enable vulnerability analyses of real-sized problems with more than 10,000 power lines.

99 GENERAL AND MISCELLANEOUS↗

Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints

Here, we propose a novel global solution algorithm for the network-constrained unit commitment problem that incorporates a nonlinear alternating current (AC) model of the transmission network, which is a nonconvex mixed-integer nonlinear programming (MINLP) problem. Our algorithm is based on the multi-tree global optimization methodology, which iterates between a mixed-integer lower-bounding problem and a nonlinear upper-bounding problem. We exploit the mathematical structure of the unit commitment problem with AC power flow constraints (UC-AC) and leverage second-order cone relaxations, piecewise outer approximations, and optimization-based bounds tightening to guarantee a globally optimal solution at convergence. Numerical results on four benchmark problems illustrate the effectiveness of our algorithm, both in terms of convergence rate and solution quality.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Grid Optimization Lawrence Livermore Nonlinear Programming

Modelling and solution library for security-constrained AC optimal power flow problems that uses nonlinear programming methods (interior-point methods) and solvers (Ipopt, HiOp). The code is written in C++ and provides parallel computing capabilities in the form of task parallelism (solving contingency problems in parallel). Code can run on a variety of commodity high-performance computing.

Petra, CosminG↗

KETCHUP: Parameterizing of large-scale kinetic models using multiple datasets with different reference states

Large-scale kinetic models provide the computational means to dynamically link metabolic reaction fluxes to metabolite concentrations and enzyme levels while also conforming to substrate level regulation. However, the development of broadly applicable frameworks for efficiently and robustly parameterizing models remains a challenge. Challenges arise due to both the heterogeneity, paucity, and difficulty in obtaining flux and/or concentration data but also due to the computational difficulties of the underlying parameter identification problem. Both the computational demands for parameterization, degeneracy of obtained parameter solutions and interpretability of results has so far limited widespread adoption of large-scale kinetic models despite their potential. Herein, we introduce the Kinetic Estimation Tool Capturing Heterogeneous Datasets Using Pyomo (KETCHUP), a flexible parameter estimation tool that leverages a primal-dual interior-point algorithm to solve a nonlinear programming (NLP) problem that identifies a set of parameters capable of recapitulating the (non)steady-state fluxes and concentrations in wild-type and perturbed metabolic networks. KETCHUP is benchmarked against previously parameterized large-scale kinetic models demonstrating an at least an order of magnitude faster convergence than the tool K-FIT while at the same time attaining better data fits. Finally, this versatile toolbox accepts different kinetic descriptions, metabolic fluxes, enzyme levels and metabolite concentrations, under either steady-state or instationary conditions to enable robust kinetic model construction and parameterization. KETCHUP supports the SBML format and can be accessed at https://github.com/maranasgroup/KETCHUP.

59 BASIC BIOLOGICAL SCIENCES↗

Vehicle-to-manufacturing (V2M) system: A novel approach to improve energy demand flexibility for demand response towards sustainable manufacturing

The U.S. manufacturing sector accounts for 77% of the industrial energy consumption, but its participation in demand response (DR) programs is largely lagged behind. The limited flexibility in production scheduling under high capacity utilization and the lack of DR schemes that incorporate energy demand flexibility measures are deemed as major barriers. In this study, a framework of the interactive vehicles-to-manufacturing (V2M) energy sharing system is proposed to improve the energy demand flexibility of the aggregated system and enhance the DR effectiveness for manufacturers. The V2M-based DR scheme aims to reduce the energy cost by load shifting through joint production and energy sharing control, which can eventually promote manufacturing DR implementation even under high capacity utilization requirements and dynamic real-time electricity prices. The V2M system is modeled based on a discrete-Markov chain considering the complex interconnections among various manufacturing resources and multi-directional energy flows among manufacturing facilities, electric vehicles, and the power grid. Based on the system model, a mixed-integer nonlinear programming (MINLP) problem is formulated to identify the optimal DR scheme. The effectiveness of the proposed approach is validated through comparisons with traditional manufacturing DR schemes. Finally, the results show that a 2.1 to 6.5 times energy demand flexibility improvement and an additional 4.7% to 6.9% energy cost reduction can be achieved by the proposed approach.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Tunable phononic bandgap materials designed via topology optimization

Topology optimization is used to design phononic bandgap materials that are tunable by mechanical deformation. A periodic media is considered, which due to the assumption of length scale separation, allows the dispersion relations to be obtained by analyzing a single unit cell subjected to Floquet–Bloch boundary conditions. A finite macroscopic deformation is applied to the unit cell to affect its geometry and hence dispersion. We tune the dispersion–deformation relation to our liking by solving a topology optimization problem using nonlinear programming. The adjoint method is employed to compute the sensitivities, and the non-differentiability of degenerate eigenvalues is avoided using symmetric polynomials. Several tunable phononic crystal designs are presented. Also, a verification analysis is performed, wherein the optimized design is interpreted and analyzed using a conforming finite element mesh.

42 ENGINEERING↗

Pole-zero form fractional model identification in frequency domain

This paper deals with system identification in the frequency domain using non integer order models given in the pole-zero form. The usual identification techniques cannot be used in this case because of the non integer orders of differentiation which makes the problem strongly nonlinear. A general identification method based on Levenberg-Marquardt algorithm is developed and allows to estimate the (2n+2m+1) parameters of the model. Its application to identify the ''skin effect'' of a squirrel cage induction machine modeling is then presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving multi-leader-common-follower games.

Multi-leader-common-follower games arise when modelling two or more competitive firms, the leaders, that commit to their decisions prior to another group of competitive firms, the followers, that react to the decisions made by the leaders. These problems lead in a natural way to equilibrium problems with equilibrium constraints (EPECs). We develop a characterization of the solution sets for these problems and examine a variety of nonlinear optimization and nonlinear complementarity formulations of EPECs. We distinguish two broad cases: problems where the leaders can cost-differentiate and problems with price-consistent followers. We demonstrate the practical viability of our approach by solving a range of medium-sized test problems.

97 MATHEMATICS AND COMPUTING↗

Hidden Moving Target Defense against False Data Injection in Distribution Network Reconfiguration

This paper introduces Moving Target Defense (MTD) in distribution system against False Data Injection (FDI) attacks on the supervisory control and data acquisition (SCADA) system. Based on the AC power flow model, a hidden MTD (HMTD) strategy is constructed in combination with network reconfiguration by minimizing the system loss and line power flow differences before and after the HMTD. The proposed HMTD-based network reconfiguration is formulated as a mixed-integer nonlinear programming (MINLP) problem. A refined Genetic Algorithm (GA) is proposed to solve it. Numerical test is conducted in a modified IEEE-66 bus system. The simulation results show that the proposed model reduces the power loss introduced by the HMTD as well as yields a stealthy MTD to the attackers. The impact of HMTD on the system performance is also compared with that of the existing MTD strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

maranasgroup/KETCHUP

Repository for Kinetic Estimation Tool Capturing Heterogeneous Datasets Using Pyomo (KETCHUP), a flexible parameter estimation tool that leverages a primal-dual interior-point algorithm to solve a nonlinear programming (NLP) problem that identifies a set of parameters capable of recapitulating the steady-state fluxes and concentrations in wild-type and perturbed metabolic networks.

Suthers, Patrick↗

solveME: fast and reliable solution of nonlinear ME models

Background Genome-scale models of metabolism and macromolecular expression (ME) significantly expand the scope and predictive capabilities of constraint-based modeling. ME models present considerable computational challenges: they are much (>30 times) larger than corresponding metabolic reconstructions (M models), are multiscale, and growth maximization is a nonlinear programming (NLP) problem, mainly due to macromolecule dilution constraints. Results Here, we address these computational challenges. We develop a fast and numerically reliable solution method for growth maximization in ME models using a quad-precision NLP solver (Quad MINOS). Our method was up to 45 % faster than binary search for six significant digits in growth rate. We also develop a fast, quad-precision flux variability analysis that is accelerated (up to 60× speedup) via solver warm-starts. Finally, we employ the tools developed to investigate growth-coupled succinate overproduction, accounting for proteome constraints. Conclusions Just as genome-scale metabolic reconstructions have become an invaluable tool for computational and systems biologists, we anticipate that these fast and numerically reliable ME solution methods will accelerate the wide-spread adoption of ME models for researchers in these fields.

Biochemistry & Molecular Biology↗

Algorithm for Nonlinear Optimization of Finishing Operations

A model is proposed for nonlinear optimization of final turning. On that basis, an automated computational algorithm is developed. The algorithm maximizes the productivity, while maintaining specified quality of the machined surface.

42 ENGINEERING↗

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↗

Joint Design of Multimodal Transit Networks and Shared Autonomous Mobility Fleets

Providing quality transit service to travelers in low-density areas, particularly travelers without personal vehicles, is a constant challenge for transit agencies. The advent of fully-autonomous vehicles (AVs) and their inclusion in mobility service fleets may allow transit agencies to offer better service and/or reduce their own capital and operational costs. This study focuses on the problem of allocating resources between transit patterns and operating (or subsidizing) shared-use AV mobility services (SAMSs) in a large metropolitan area. To address this question, a joint transit network redesign and SAMS fleet size determination problem (JTNR-SFSDP) is introduced, and a bi-level mathematical programming formulation and solution approach are presented. The upper-level problem modifies a transit network frequency setting problem (TNFSP) formulation via incorporating SAMS fleet size as a decision variable and allowing the removal of bus routes. The lower-level problem consists of a dynamic combined mode choice-traveler assignment problem (DCMC-TAP) formulation. The heuristic solution procedure involves solving the upper-level problem using a nonlinear programming solver and solving the lower-level problem using an iterative agent-based assignment-simulation approach. To illustrate the effectiveness of the modeling framework, this study uses traveler demand from Chicago along with the regions existing multimodal transit network. The computational results indicate significant traveler benefits, in terms of improved average traveler wait times, associated with optimizing the joint design of multimodal transit networks and SAMS fleets compared with the initial transit network design.

bi-level programming↗

On the Value Function of Weakly Coercive Problems in Nonlinear Stochastic Control

In this paper we investigate via a dynamic programming approach some nonlinear stochastic control problems where the control set is unbounded and a classical coercivity hypothesis is replaced by some weaker assumptions. We prove that these problems can be approximated by finite fuel problems; show the continuity of the relative value functions and characterize them as unique viscosity solutions of a quasi-variational inequality with suitable boundary conditions.

97 MATHEMATICS AND COMPUTING↗

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

97 MATHEMATICS AND COMPUTING↗