10 Matching Results

Search Results

Advanced search parameters have been applied.
in subjects: "Linear Programming"  
Results: 1 - 10
open access

New approaches to linear and nonlinear programming

Description: This report describes technical progress during the past twelve months on DOE Contract DE-FG-87ER25030 and requests support for the third year. The project involves study of the theoretical properties and computational performance of techniques that solve linear and nonlinear programs by means of nonlinear transformations. The group at the Systems Optimization Laboratory (SOL) were the first to recognize the connection between Karmarkar's projective method and the logarithmic barrier method. It… more
Date: September 1, 1988
Creator: Murray, W. & Saunders, M.A.
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department
open access

Enhanced algorithms for stochastic programming

Description: In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions… more
Date: September 1, 1993
Creator: Krishna, A. S.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries Government Documents Department
open access

Final report, DOE Grant DE-FG02-98ER25352, Computational semidefinite programming

Description: Semidefinite programming (SDP) is an extension of linear programming, with vector variables replaced by matrix variables and component wise nonnegativity replaced by positive semidefiniteness. SDP's are convex, but not polyhedral, optimization problems. SDP is well on its way to becoming an established paradigm in optimization, with many current potential applications. Consequently, efficient methods and software for solving SDP's are of great importance. During the award period, attention was … more
Date: September 5, 2002
Creator: Overton, Michael L.
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department
open access

On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming

Description: A method for finding a global optimum to the on-off minimum-time control problem with limited fuel usage is presented. Each control can take on only three possible values: maximum, zero, or minimum. The simplex method for linear systems naturally yields such a solution for the re-formulation presented herein because it always produces an extreme point solution to the linear program. Numerical examples for the benchmark linear flexible system are presented.
Date: September 1, 1999
Creator: DRIESSEN,BRIAN
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
open access

California Marginal-Cost-Pricing Project. [Analysis of Methods Used to Quantify MCP]

Description: This report provides a detailed analysis of methods to quantify the marginal costs of electricity supply. The nine-point criteria used include measurement of marginal costs that are consistent with economic theory, and determination of the applicability of the method and results in regulatory proceedings. The report examines methods which cover a wide range of potential cost-measurement techniques, including linear-programming models of utility systems, production functions, and simple models b… more
Date: September 1, 1979
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department
open access

Research on primal-dual interior point algorithms for mathematical programming. Final technical report, August 1991--August 1993

Description: Today interior-point methods of choice for general linear programming are primal-dual infeasible interior-point algorithms. There is a big gap between theoretical algorithms and practical algorithms. Major goals of the project were to narrow the gaps between theory and practice of primal-dual interior-point methods. The PI (principal investigator) played a leading role in joint work with Richard Tapia on constructing the first superlinear and polynomial primal-dual algorithm. PI`s recent work o… more
Date: September 1, 1993
Creator: Zhang, Yin
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department
open access

Determinacy in network models: a study of structure and correlation

Description: The concept of determinacy measures the consistency of interaction between the operating variables or parameters of a large-scale model. Determinacy is first defined in a general input-output model, and is related to similar concepts in economics and linear programming. It is then applied to a particular network flow model. Special techniques are then developed to detect determinacy in this model and these techniques are applied to two special classes of networks to uncover the high degree of d… more
Date: September 1, 1980
Creator: Provan, J. S. & Kydes, A. S.
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department
open access

The delayed coupling method: An algorithm for solving banded diagonal matrix problems in parallel

Description: We present a new algorithm for solving banded diagonal matrix problems efficiently on distributed-memory parallel computers, designed originally for use in dynamic alternating-direction implicit partial differential equation solvers. The algorithm optimizes efficiency with respect to the number of numerical operations and to the amount of interprocessor communication. This is called the ``delayed coupling method`` because the communication is deferred until needed. We focus here on tridiagonal … more
Date: September 1, 1997
Creator: Mattor, N.; Williams, T. J.; Hewett, D. W. & Dimits, A. M.
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
open access

Research on infeasible interior-point algorithms for linear and nonlinear programming. Final technical report, August 1995--August 1997

Description: The current project is a renewal of the PI`s previous projects supported by the Department of Energy. The original funding period for this project was from August 15, 1995 to August 14, 1996. The expiration date of the project was extended at no cost to August 14, 1997 in order to ensure a adequate completion of the original scope of work within the available funds. During this extended project period, the PI moved from the University of Maryland Baltimore County to Rice University. The primary… more
Date: September 1, 1997
Creator: Zhang, Yin
Item Type: Refine your search to only Report
Partner: UNT Libraries Government Documents Department
open access

Interval Assignment for Volumes with Holes

Description: This paper presents a new technique for automatically detecting interval constraints for swept volumes with holes. The technique finds true volume constraints that are not necessarily imposed by the surfaces of the volume. A graphing algorithm finds independent, parallel paths of edges from source surfaces to target surfaces. The number of intervals on two paths between a given source and target surface must be equal; in general, the collection of paths determine a set of linear constraints. Li… more
Date: September 7, 1999
Creator: BENZLEY, STEVEN; MITCHELL, SCOTT A. & SHEPHERD, JASON F.
Item Type: Refine your search to only Article
Partner: UNT Libraries Government Documents Department
Back to Top of Screen