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 19 records

Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution

This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when α{sup –}. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen’s method is employed to find a compromise solution, supported by illustrative numerical example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Multi-Parametric optimization approach for bilevel mixed-integer linear and quadratic programming problems

Optimization problems involving two decision makers at two different decision levels are referred to as bi-level programming problems. Herein, we present novel algorithms for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer convex quadratic programming problems (B-MIQP) containing both integer and bounded continuous variables at both optimization levels. Based on multi-parametric programming theory, the main idea is to recast the lower level problem as a multi-parametric programming problem, in which the optimization variables of the upper level problem are considered as bounded parameters for the lower level. The resulting exact multi-parametric mixed-integer linear or quadratic solutions are then substituted into the upper level problem, which can be solved as a set of single-level, independent, deterministic mixed-integer optimization problems. Extensions to problems including right-hand-side uncertainty on both lower and upper levels are also discussed. Finally, computational implementation and studies are presented through test problems.

42 ENGINEERING↗

Coordinated PEV Charging for Distribution System Management

Plug-in electric vehicles (PEVs) can help to reduce worldwide dependence on petroleum and carbon emissions. In the past a few years, PEVs have received considerable attention as an eco-friendly and cost-effective alternative to conventional gasoline vehicles. PEVs consume higher power from the grid during charging compared to conventional residential loads. Therefore, the emerging fleet of PEVs will introduce a considerable amount of additional load on power system. On the other hand, majority of PEVs are parked for more than 90% of the time, making them ideal for providing various services through Electric Vehicle Supply Equipment (EVSE), a.k.a. charging stations which are PEVs’ connection points to the power system. In this project, coordinated PEV charging are developed to provide distribution system services, considering PEV characteristics, realistic travel pattern, charging behaviors, and EVSE power rating and availability. The main efforts and contributions are summarized as follows. • Mobility models and EVSE charging capability/availability are indispensable for evaluating PEV charging coordination strategies and developing PEV charging control. Many existing studies utilize simplified mobility models assuming that the entire vehicle fleet returns home in the evening and is parked at home until the next morning. Some other PEV models better represent diversified home arrival and departure time, but cannot capture varying charging flexibility and capability at different locations, and therefore are not appropriate to study the impacts of public EVSE on PEV load and utilization. In this work, a mobility and charging flexibility model is proposed to better represent the temporal availability and varying charging capability from PEV onboard charger and EVSE. • Based on the mobility model, a generalized optimization method is proposed to evaluate different PEV charging coordination strategies. In existing literature, different algorithms and methods need to be designed to evaluate each charging strategy from both vehicle owners’ and system’s perspective. With the optimization method proposed in this work, different charging control strategies can be studied and compared by only updating objective functions. Moreover, optimization tricks are provided to convert the optimization problems to equivalent linear programming problems, which can be efficiently solved with existing solvers. • An innovative scheduling and control framework is proposed to enable smart PEV charging for grid services while meeting PEV owners’ travel needs. In the proposed framework, each set of EVSE is equipped with a controller that estimates charging power and energy flexibility based on vehicle characteristics, EVSE power rating, battery energy state, and upcoming trip information. With the simplified charging flexibility model received from each EVSE controller, the central coordinator determines the optimal power allocation for a look-ahead time window for the given grid services. The proposed charging control can help reduce the computational complexity and communication requirement compared with existing methods. It is also scalable to the expanding PEV fleet and robust to uncertainties in upcoming vehicle trips and future system condition. • The proposed charging strategy evaluation and smart charging control methods are applied to one of the prototypical feeders developed by the Pacific Northwest National Laboratory (PNNL) for case studies. Detailed trip information extracted from the National Household Travel Survey (NHTS) is used to represent travel and parking patterns. Different scenarios are simulated to evaluate the performance of the proposed methods and understand how PEV mobility and public EVSE availability affect PEV load and potential grid services.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

Solution of Mixed-Integer Programming Problems on the XT5

In this paper, we describe our experience with solving difficult mixed-integer linear programming problems (MILPs) on the petaflop Cray XT5 system at the National Center for Computational Sciences at Oak Ridge National Laboratory. We describe the algorithmic, software, and hardware needs for solving MILPs and present the results of using PICO, an open-source, parallel, mixed-integer linear programming solver developed at Sandia National Laboratories, to solve canonical MILPs as well as problems of interest arising from the logistics and supply chain management field.

99 GENERAL AND MISCELLANEOUS↗

Generic Optimization Program User Manual Version 3.0.0

GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Effective restoration strategies of interdependent power system and communication network

The power system is continuously evolving towards a smarter grid by adding intelligent electrical devices that leverage communication technologies to provide visualisation, control and automation. The integration of power system and communication network has brought challenges into the resilience of interdependent networks. Following an outage or blackout, system operators cannot only restore one network while simply ignoring the interconnection with the other network. Effective restoration strategies that involve co‐ordination between power system and communication network have become critical in enhancing the resilience. An optimisation‐based restoration strategy is developed to coordinate the restoration actions between two networks. The problem is modelled as a mixed integer linear programming problem, with the objective of activating every node in both networks with the minimum number of activation/energisation of branches. The developed strategies are tested on the modified IEEE 14‐bus system incorporating communication network. Simulation results demonstrate that the coordinated restoration strategies are effective and critical in the successful recovery of interdependent networks. The developed model could also provide insights in network design and planning to enhance the resilience of interdependent power system and communication network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal PMU Restoration for Power System Observability Recovery After Massive Attacks

Cyber-physically resilient power system operation requires rapid recovery of situational awareness after disastrous scenarios such as massive cyber attacks. In this article, the concept of optimal sequential restoration of Phasor Measurement Units is introduced, aiming at rapid recovery of power system observability in post-attack scenarios. Additionally, the observability recovery problem is formulated as a Mixed Integer Linear Programming problem to maximize the cumulative observability level gained over time during the restoration process. Three alternative objective functions-maximizing the number of observable buses, the number of observable branches, and the total amount of observable power flow-are considered. The effectiveness of the proposed optimal strategy is verified by comparing it with heuristic approaches on the IEEE 57-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Incorporating Wind Energy in Power System Restoration Planning

Wind energy is rapidly growing. While wind brings us clean and inexpensive energy, its inherent variability and uncertainty present challenges for the power grid. In particular, employing wind energy for power system restoration is very challenging. A fast and reliable restoration plays a vital role to achieve the self-healing power grid. This paper develops a novel offline restoration planning tool for harnessing wind energy to enhance grid resilience. The Wind-for-Restoration problem is formulated as a stochastic mixed-integer linear programming problem with generated wind energy scenarios. The problem is then decomposed into two stages and solved with the integer Lshaped algorithm. Numerical experiments have been conducted through different case studies using the modified IEEE 57-bus system. The developed tool can provide the scheduled wind power at each restoration time. The impact of wind energy is investigated from the aspects of location and inertia capability, as well as wind penetration, fluctuation, and uncertainty. Moreover, a dynamic response validation tool is developed to validate the results of optimization problem in a dynamic simulation software. Finally, simulation results demonstrate that the optimal wind harnessing strategy can help improve system restoration process and enhance system resilience.

17 WIND ENERGY↗

TAS: 89 0227: TAS Recovery Act - Optimization and Control of Electric Power Systems: ARRA

The name SuperOPF is used to refer several projects, problem formulations and soft-ware tools intended to extend, improve and re-define some of the standard methods of optimizing electric power systems. Our work included applying primal-dual interior point methods to standard AC optimal power flow problems of large size, as well as extensions of this problem to include co-optimization of multiple scenarios. The original SuperOPF problem formulation was based on co-optimizing a base scenario along with multiple post-contingency scenarios, where all AC power flow models and constraints are enforced for each, to find optimal energy contracts, endogenously determined locational reserves and appropriate nodal energy prices for a single period optimal power flow problem with uncertainty. This led to example non-linear programming problems on the order of 1 million constraints and half a million variables. The second generation SuperOPF formulation extends this by adding multiple periods and multiple base scenarios per period. It also incorporates additional variables and constraints to model load following reserves, ramping costs, and storage resources. A third generation of the multi-period SuperOPF, adds both integer variables and a receding horizon framework in which the problem type is more challenging (mixed integer), the size is even larger, and it must be solved more frequently, pushing the limits of currently available algorithms and solvers. The consideration of transient stability constraints in optimal power flow (OPF) problems has become increasingly important in modern power systems. Transient stability constrained OPF (TSCOPF) is a nonlinear optimization problem subject to a set of algebraic and differential equations. Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability in OPF. To handle the dynamics in TSCOPF, the set of differential equations can be approximated or converted into equivalent algebraic equations before they are included in an OPF formulation. In Chapter 4, a rigorous evaluation of using a predefined and fixed threshold for rotor angles as a mean to determine transient stability of the system is developed. TSCOPF can be modeled as a large-scale nonlinear programming problem including the constraints of differential-algebraic equations (DAE). Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability constraint in OPF. Unfortunately, even the current best TSCOPF solvers still suffer from the curse of dimensionality and unacceptable computational time, especially for large-scale power systems with multiple contingencies. In chapter 5, thse issues will be addressed and a new method to incorporate the transient stability constraints will be presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal planning for the sustainable utilization of municipal solid waste

Highlights: • An optimization approach for the sustainable management of municipal solid waste is proposed. • The proposed model optimizes the entire supply chain network of a distributed system. • A case study for the sustainable waste management in the central-west part of Mexico is presented. • Results shows different interesting solutions for the case study presented. - Abstract: The increasing generation of municipal solid waste (MSW) is a major problem particularly for large urban areas with insufficient landfill capacities and inefficient waste management systems. Several options associated to the supply chain for implementing a MSW management system are available, however to determine the optimal solution several technical, economic, environmental and social aspects must be considered. Therefore, this paper proposes a mathematical programming model for the optimal planning of the supply chain associated to the MSW management system to maximize the economic benefit while accounting for technical and environmental issues. The optimization model simultaneously selects the processing technologies and their location, the distribution of wastes from cities as well as the distribution of products to markets. The problem was formulated as a multi-objective mixed-integer linear programing problem to maximize the profit of the supply chain and the amount of recycled wastes, where the results are showed through Pareto curves that tradeoff economic and environmental aspects. The proposed approach is applied to a case study for the west-central part of Mexico to consider the integration of MSW from several cities to yield useful products. The results show that an integrated utilization of MSW can provide economic, environmental and social benefits.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Phase-based design of CO 2 capture, transport, and storage infrastructure via SimCCS 3.0

The design of optimal infrastructure is essential for the deployment of commercial and large-scale carbon capture and storage (CCS) technology. During the design process, it is important to consider CO 2 capture and storage locations and CO 2 transportation pipelines to minimize the total project cost. SimCCS, first introduced in 2009, is an integrated open-source tool to optimize CCS infrastructure. The core CCS infrastructure design problem in SimCCS is structured as a mixed-integer linear programming problem by selecting the optimal pipeline routes, searching CO 2 source capture and storage locations, and determining the corresponding CO 2 amounts to meet desired capture targets. Multiple important and practical features have been developed to the latest version of SimCCS, SimCCS 3.0 . One of these features is phase-based modeling which enables users to dynamically design the CCS infrastructure. We demonstrate the phased-based modeling capability using two CCS infrastructure optimization case studies. The results from these case studies reveal that the phase-based modeling capability in SimCCS is particularly useful to optimize the dynamic deployment of CCS projects.

54 ENVIRONMENTAL SCIENCES↗

A Stochastic Programming Formulation for Disinfectant Booster Station Placement to Protect Large-Scale Water Distribution Networks

We introduce a methodology for optimally locating fixed disinfectant booster stations for response to contamination incidents in water distribution networks. In this work a stochastic programming problem considering uncertainty in both the location and time of the contamination incident is formulated, resulting in a large Mixed Integer Linear Programming problem. While the original full-space problem is intractably large, we show a series of reductions that decrease the size of the problem by up to five orders of magnitude and allow solutions of the optimal placement problem for realistically-sized water network models.

42 ENGINEERING↗

Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution

In order to express a polyhedron as the Minkowski sum of a polytope and a polyhedral cone, Motzkin (Beiträge zur Theorie der linearen Ungleichungen. Dissertation, University of Basel, 1936) devised a homogenization technique that translates the polyhedron to a polyhedral cone in one higher dimension. Refining his technique, we present a conical representation of a set in the Euclidean space. Then, we use this representation to reach four main results: First, we establish a convex programming based framework for determining a maximal element—an element with the maximum number of positive components—of a non-negative convex set—a convex set in the non-negative Euclidean orthant. Second, we develop a linear programming problem for finding a relative interior point of a polyhedron. Third, we propose two procedures for identifying a strictly complementary solution in linear programming. Finally, we generalize Motzkin’s (Beiträge zur Theorie der linearen Ungleichungen. Dissertation, University of Basel, 1936) representation theorem for a class of closed convex sets in the Euclidean space.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-258: Parallel Optimization of Beam Configurations for CyberKnife Treatments

Purpose: The CyberKnife delivers a large number of beams originating at different non-planar positions and with different orientation. We study how much the quality of treatment plans depends on the beams considered during plan optimization. Particularly, we evaluate a new approach to search for optimal treatment plans in parallel by running optimization steps concurrently. Methods: So far, no deterministic, complete and efficient method to select the optimal beam configuration for robotic SRS/SBRT is known. Considering a large candidate beam set increases the likelihood to achieve a good plan, but the optimization problem becomes large and impractical to solve. We have implemented an approach that parallelizes the search by solving multiple linear programming problems concurrently while iteratively resampling zero weighted beams. Each optimization problem contains the same set of constraints but different variables representing candidate beams. The search is synchronized by sharing the resulting basis variables among the parallel optimizations. We demonstrate the utility of the approach based on an actual spinal case with the objective to improve the coverage. Results: The objective function is falling and reaches a value of 5000 after 49, 31, 25 and 15 iterations for 1, 2, 4, and 8 parallel processes. This corresponds to approximately 97% coverage in 77%, 59%, and 36% of the mean number of iterations with one process for 2, 4, and 8 parallel processes, respectively. Overall, coverage increases from approximately 91.5% to approximately 98.5%. Conclusion: While on our current computer with uniform memory access the reduced number of iterations does not translate into a similar speedup, the approach illustrates how to effectively parallelize the search for the optimal beam configuration. The experimental results also indicate that for complex geometries the beam selection is critical for further plan optimization.

07 ISOTOPE AND RADIATION SOURCES↗