Operations Research Center: Recent submissions
Now showing items 34-36 of 372
-
A Potential Reduction Algorithm With User-Specified Phase I - Phase II Balance, for Solving a Linear Program from an Infeasible Warm Start
(Massachusetts Institute of Technology, Operations Research Center, 1991-10)This paper develops a potential reduction algorithm for solving a linear-programming problem directly from a "warm start" initial point that is neither feasible nor optimal. The algorithm is of an "interior point" variety ... -
Computational experience and the explanatory value of condition numbers for linear optimization
(Massachusetts Institute of Technology, Operations Research Center, 2002)The goal of this paper is to develop some computational experience and test the practical relevance of the theory of condition numbers C(d) for linear optimization, as applied to problem instances that one might encounter ... -
Optimizing Constrained Subtrees of Trees
(Massachusetts Institute of Technology, Operations Research Center, 1992-07)Given a tree G = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the "rooted subtree problem", is to find a maximum weight subtree, with a specified root, ...
