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

Menu-Driven Solver Of Linear-Programming Problems

Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

Viterna, L. A.↗

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↗

An improved exploratory search technique for pure integer linear programming problems

The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

Fogle, F. R.↗

Linear Programming and Its Application to Pattern Recognition Problems

Linear programming and linear programming like techniques as applied to pattern recognition problems are discussed. Three relatively recent research articles on such applications are summarized. The main results of each paper are described, indicating the theoretical tools needed to obtain them. A synopsis of the author's comments is presented with regard to the applicability or non-applicability of his methods to particular problems, including computational results wherever given.

Omalley, M. J.↗

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↗

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem is incorporated into the framework of an in-line motion-planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning, the deterministic problem where the information about the objects is assumed to be certain is examined. L(1) or L(infinity) norms are used to represent distance and the problem becomes a linear programming problem. The stochastic problem is formulated where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: First, filtering of the distance between the robot and the moving object at the present time. Second, prediction of the minimum distance in the future in order to predict the collision time.

Kyriakopoulos, K. J.↗

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem has been incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L(sub 1) or L(sub infinity) norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: (1) filtering of the minimum distance between the robot and the moving object, at the present time; and (2) prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time.

Kyriakopoulos, K. J.↗

Cylindrical Optic Polishing Dwell Time Optimization

The Constellation-X x-ray telescope consists of replicated grazing incidence optics. The polishing of the "master' mandrel is accomplished by moving a polishing tool along a helical path on the surface of this almost cylindrical surface. The measurement of the surface is, however, performed along "axial" scan lines which intercept this helical path. This approach to polishing and measuring permits a relatively simple scheme to be implemented for the determination of the optimal dwell times of the polishing tool. These optimal dwell times are determined by a deconvolution which approaches the problem as a linear programming problem and uses the simplex method. This approach maximizes the amount of material removed at any point subject to inequality constraints. The effects of using these "optimum" dwell times is to significantly improve the "tools" effectiveness at removing the higher spatial frequencies while staying (strictly) within the bounds and constraints imposed by the hardware. In addition the "ringing" at the edges of the optic, frequently present in deconvolution problems, is completely eliminated.

Waluschka, Eugene↗

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↗

Optimum testing of multiple hypotheses in quantum detection theory

The problem of specifying the optimum quantum detector in multiple hypotheses testing is considered for application to optical communications. The quantum digital detection problem is formulated as a linear programming problem on an infinite-dimensional space. A necessary and sufficient condition is derived by the application of a general duality theorem specifying the optimum detector in terms of a set of linear operator equations and inequalities. Existence of the optimum quantum detector is also established. The optimality of commuting detection operators is discussed in some examples. The structure and performance of the optimal receiver are derived for the quantum detection of narrow-band coherent orthogonal and simplex signals. It is shown that modal photon counting is asymptotically optimum in the limit of a large signaling alphabet and that the capacity goes to infinity in the absence of a bandwidth limitation.

Yuen, H. P.↗