Browsing Rice University Electronic Theses and Dissertations by Subject "Operations Research"
Now showing items 144 of 44

A computational study of vehicle routing applications
(1999)This thesis examines three specific routing applications. In the first model, the scheduling of home health care providers from their homes, to a set of patients, and then back to their respective homes, is performed both ... 
A GENERAL ALGORITHM FOR DETERMINING LIKELIHOOD RATIOS IN CASCADED INFERENCE
(1981)In cascaded inference tasks there is not a direct logical connection between an observable event (datum) and the hypothesis of interest. Instead there is interposed at least one logical reasoning stage, consisting of ... 
A modified augmented Lagrangian merit function, and Qsuperlinear characterization results for primaldual QuasiNewton interiorpoint method for nonlinear programming
(1997)Two classes of primaldual interiorpoint methods for nonlinear programming are studied. The first class corresponds to a pathfollowing Newton method formulated in terms of the nonnegative variables rather than all primal ... 
A new class of preconditioners for largescale linear systems from interiorpoint methods for linear programming
(1997)A new class of preconditioners for the iterative solution of the linear systems arising from interior point methods is proposed. For many of these methods, the linear systems come from applying Newton's method on the ... 
A robust choice of the Lagrange multipliers in the successive quadratic programming method
(1994)We study the choice of the Lagrange multipliers in the successive quadratic programming method (SQP) applied to the equality constrained optimization problem. It is known that the augmented Lagrangian SQPNewton method ... 
A subgradient algorithm for nonlinear integer programming and its parallel implementation
(1991)This work concerns efficiently solving a class of nonlinear integer programming problems: min $\{f(x)$: $x \in \{0,1\}\sp{n}\}$ where $f(x)$ is a general nonlinear function. The notion of subgradient for the objective ... 
A TRUST REGION STRATEGY FOR NONLINEAR EQUALITY CONSTRAINED OPTIMIZATION (NONLINEAR PROGRAMMING, SEQUENTIAL QUADRATIC)
(1985)Many current algorithms for nonlinear constrained optimization problems determine a search direction by solving a quadratic programming subproblem. The global convergence properties are addressed by using a line search ... 
An efficient algorithm for total variation regularization with applications to the single pixel camera and compressive sensing
(2010)In this thesis, I propose and study an efficient algorithm for solving a class of compressive sensing problems with total variation regularization. This research is motivated by the need for efficient solvers capable of ... 
AN INTERACTIVE APPROACH FOR SOLVING MULTIOBJECTIVE OPTIMIZATION PROBLEMS (INTERACTIVE COMPUTER, NELDERMEAD SIMPLEX ALGORITHM, GRAPHICS)
(1985)Multiobjective optimization problems are characterized by the need to consider multiple, and possibly conflicting, objectives in the solution process. We present an approach based on the use of interactive computer graphics ... 
Branch decompositions and their applications
(2000)Many reallife problems can be modeled as optimization or decision problems on graphs. Also, many of those reallife problems are NPhard. One traditional method to solve these problems is by branch and bound while another ... 
Convergence properties of the Barzilai and Borwein gradient method
(1991)In a recent paper, Barzilai and Borwein presented a new choice of steplength for the gradient method. Their choice does not guarantee descent in the objective function and greatly speeds up the convergence of the method. ... 
Effective computation of the analytic center of the solution set in linear programming using primaldual interiorpoint methods
(1995)The centrality property satisfied by the analytic center of the solution set makes its computation very valuable for some linear programming applications. One such application coming from the economic and management sciences ... 
Effective finite termination procedures in interiorpoint methods for linear programming
(1998)Due to the structure of the solution set, an exact solution to a linear program cannot be computed by an interiorpoint algorithm without adding features, such as finite termination procedures, to the algorithm. Finite ... 
Ellipsoidal approximation to polytopes and computational study of Lenstra's algorithm
(2002)General integer programming is an important mathematical approach for many decisionmaking problems. In this field, a major theoretical breakthrough came in 1983 when H. W. Lenstra, Jr. proposed a polynomialtime algorithm ... 
Exact and inexact Newton linesearch interiorpoint algorithms for nonlinear programming problems
(1997)In the first part of this research we consider a linesearch globalization of the local primaldual interiorpoint Newton's method for nonlinear programming recently introduced by ElBakry, Tapia, Tsuchiya, and Zhang. Our ... 
Exploiting balanced trees in the computation of elementary flux modes via breadthfirst search
(2006)In order to rationally design bacteria to produce large quantities of their precious metabolic byproducts, we must first understand the metabolic pathways that lead from a starting material (e.g., glucose) to a metabolic ... 
Independence systems and stable set relaxations
(2008)Many fundamental combinatorial optimization problems involve the search for subsets of graph elements which satisfy some notion of independence. This thesis develops techniques for optimizing over a class of independence ... 
New algorithms for pathwidth computation
(2004)The notions of pathwidth and the closely related treewidth have become more and more important recently. The importance lies not only in theory but also in practice. Theoretically, lots of NPhard problems become polynomially ... 
Nonlinear multicriteria optimization and robust optimality
(1997)This dissertation attempts to address two important problems in systems engineering, namely, multicriteria optimization and robustness optimization. In fields ranging from engineering to the social sciences designers are ... 
On characterizing graphs with branchwidth at most four
(2001)There are several ways in which we can characterize classes of graphs. One such way of classifying graphs is by their branchwidth. In working to characterize the class of graphs with branchwidth at most four beta 4 we have ... 
On eliminating square paths in a square lattice
(2000)Removing the minimum number of vertices or points from a square lattice such that no square path exists is known as the square path problem. Finding this number as the size of the lattice increases is not so trivial. Results ... 
On improving the accuracy of primaldual interior point methods for linear programming
(2005)Implementations of the primaldual approach in solving linear programming problems still face issues in maintaining numerical stability and in attaining high accuracy. The major source of numerical problems occurs during ... 
On the matrix cuts of Lovasz and Schrijver and their use in integer programming
(2001)An important approach to solving many discrete optimization problems is to associate the discrete set (over which we wish to optimize) with the 01 vectors in a given polyhedron and to derive linear inequalities valid for ... 
Optimizing over the cut cone: A new polyhedral algorithm for the maximumweight cut problem
(1991)Polyhedral cuttingplane algorithms for hard combinatorial problems have scored notable successes. However, computational research on the MaximumWeight Cut Problem (MCP) on undirected graphs has been inconclusive. In 1988, ... 
PARAMETER ESTIMATION OF PROBABILISTIC CHOICE MODELS
(1985)Probabilistic choice models are used by economists, psychologists, and marketing scientists in the analysis of choice behavior involving discrete, or quantal choice alternatives. The most widelyused of these is the ... 
Pattern search algorithms for mixed variable general constrained optimization problems
(2003)A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. The AudetDennis Generalized Pattern Search (GPS) algorithm for bound constrained mixed variable optimization ... 
Performance virtualization and QoS in shared storage systems
(2008)To handle the growing demands of data intensive applications, storage consolidation is becoming an attractive organizational paradigm. The benefits of consolidation include universal data access, sharing among users, ... 
Program analysis and transformation in mathematical programming
(2008)Over the years, mathematical models have become increasingly complex. Rarely can we accurately model a process using only linear or quadratic functions. Instead, we must employ complicated routines written in some programming ... 
Pseudospectral collocation methods for the direct transcription of optimal control problems
(2003)This thesis is concerned with the study of pseudospectral discretizations of optimal control problems governed by ordinary differential equations and with their application to the solution of the International Space Station ... 
Restricted 2factors in bipartite graphs
(2000)The krestricted 2factor problem is that of finding a spanning subgraph consisting of disjoint cycles with no cycle of length less than or equal to k. It is a generalization of the well known Hamilton cycle problem and ... 
Robust model predictive control as a class of semiinfinite programming problems
(1999)This thesis introduces a new interpretation of the problems arising in robust model predictive control (MPC). In practice, MPC algorithms are typically embedded within a multilevel hierarchy of control functions. The MPC ... 
Scheduling with QoS in parallel I/O systems
(2005)Parallel I/O architectures have become attractive in the context of high performance computing and services provided by high bandwidth data centers. It is challenging to provide a scheduling technique that maximizes ... 
Software design for simulation driven optimization
(2005)This thesis describes a flexible framework for abstract numerical algorithms which treats algorithms as objects and makes them reusable, composable, and modifiable. These algorithm objects are implemented using the Rice ... 
Solving structured 0/1 integer programs arising from truck dispatching scheduling problems
(1993)A branchandcut IP solver is developed for a class of structured 0/1 integer programs arising from a truck dispatching scheduling problem. This problem is characterized by a group of set partitioning constraints and a ... 
Solving very large scale school/student assignment problems
(1994)Currently, the Houston Independent School District has approximately 175 elementary schools providing education for more than 110,000 students. A question of major logistical impact is how to assign students to schools in ... 
Structured secant updates for nonlinear constrained optimization
(1991)Two new updates are presented, the UHU update and a modified Gurwitz update, for approximating the Hessian of the Lagrangian in nonlinear constrained optimization problems. Under the standard assumptions, the new UHU ... 
The solution of a class of limited diversification portfolio selection problems
(1997)A branchandbound algorithm for the solution of a class of mixedinteger nonlinear programming problems arising from the field of investment portfolio selection is presented. The problems in this class are characterized ... 
Traffic: The commute
(2003)The commute by automobile, as it happens in Houston Texas, is a spatial envelope. This envelope widens and narrows based on a set of variables: position, traffic, speed, and time of day, and it changes from day to day. The ... 
Trustregion interiorpoint algorithms for a class of nonlinear programming problems
(1996)This thesis introduces and analyzes a family of trustregion interiorpoint (TRIP) reduced sequential quadratic programming (SQP) algorithms for the solution of minimization problems with nonlinear equality constraints and ... 
Very largescale linear programming: A case study in exploiting both parallelism and distributed memory
(1994)There has been limited success with parallel implementations of both the simplex method and interior point methods for solving realworld linear programs. Experience with a parallel implementation of CPLEX, a state of the ...