Browsing Operations Research Center Working Papers by Title
Now showing items 221-240 of 372
-
On an Extension of Condition Number Theory to Non-Conic Convex Optimization
(Massachusetts Institute of Technology, Operations Research Center, 2003-02)The purpose of this paper is to extend, as much as possible, the modern theory of condition numbers for conic convex optimization: z* := minz ctx s.t. Ax - b Cy C Cx , to the more general non-conic format: z* := minx ctx ... -
On base-stock policies for make-to-order/make-to-stock program
(Massachusetts Institute of Technology, Operations Research Center, 1995) -
On Evaluating Evaluations
(Massachusetts Institute of Technology, Operations Research Center, 1979-12) -
On Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
(Massachusetts Institute of Technology, Operations Research Center, 1990-11)We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. The algorithm is based on the framework of row-action methods. The problem is formulated by replicating the first-stage ... -
On Production and Subcontracting Strategies for Manufacturers with Limited Capacity and Backlog-Dependent Demand
(Massachusetts Institute of Technology, Operations Research Center, 2001-05)We study a manufacturing firm that builds a product to stock to meet a random demand. If there is a positive surplus of finished goods, the customers make their purchases without delay and leave. If there is a backlog, the ... -
On Setup Cost Reduction in the Economic Lot-Sizing Model Without Speculative Motives
(Massachusetts Institute of Technology, Operations Research Center, 1991-08)An important special case of the economic lot-sizing problem is the one in which there are no speculative motives to hold inventory, i.e., the marginal cost of producing one unit in some period plus the cost of holding it ... -
On the Asymptotic Properties of Euclidean Dial-A-Ride Routing
(Massachusetts Institute of Technology, Operations Research Center, 1985-10)A conjecture by Stein [1], proposing a probabilistic limit result for the shortest possible route of a bus that has to transfer passengers between random locations in some region of the plane, is refuted.- The existence ... -
On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization
(Massachusetts Institute of Technology, Operations Research Center, 2004-10)There is a natural norm associated with a starting point of the homogeneous self-dual (HSD) embedding model for conic convex optimization. In this norm two measures of the HSD model’s behavior are precisely controlled ... -
On the characteristic equation of general queueing systems
(Massachusetts Institute of Technology, Operations Research Center, 1990) -
On the Chernoff bounds
(Massachusetts Institute of Technology, Operations Research Center, 1985) -
On the Complexity of Postoptimality Analysis of 0/1 Programs
(Massachusetts Institute of Technology, Operations Research Center, 1991-09)In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear objective function. After an optimal solution has been determined for a given cost vector, one may want to know how much each ... -
On the Convergence of Classical Variational Inequality Algorithms
(Massachusetts Institute of Technology, Operations Research Center, 1993-05)In this paper, we establish global convergence results for projection and relaxation algorithms for solving variational inequality problems, and for the Frank-Wolfe algorithm for solving convex optimization problems defined ... -
On the Convergence of Multiclass Queueing Networks in Heavy Traffic
(Massachusetts Institute of Technology, Operations Research Center, 1992-10)The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in-first-out (FIFO) service discipline. For special cases which require various assumptions on the network structure, ... -
On the Efficient Solution of Variational Inequalities; Complexity and Computational Efficiency
(Massachusetts Institute of Technology, Operations Research Center, 2002-01)In this paper we combine ideas from cutting plane and interior point methods in order to solve variational inequality problems efficiently. In particular, we introduce a general framework that incorporates nonlinear as ... -
On the Fine-Grain Decomposition of Multicommodity Transportation Problems
(Massachusetts Institute of Technology, Operations Research Center, 1990-11)We develop algorithms for nonlinear problems with multicommodity transportation constraints. The algorithms are of the row-action type and, when properly applied,decompose the underlying graph alternatingly by nodes and ... -
On the Improvement From Scheduling a Two-Station Queueing Network in Heavy Traffic
(Massachusetts Institute of Technology, Operations Research Center, 1990-01)For a two-station multiclass queueing network in heavy traffic, we assess the improvement from scheduling (job release and priority sequencing) that can occur relative to Poisson input and first-come first-served (FCFS) ... -
On the large deviations behavior of acyclic netowrks [sic] of G/G/1 queues
(Massachusetts Institute of Technology, Operations Research Center, 1995) -
On the Number of Latent Subsets of Intersecting Collections
(Massachusetts Institute of Technology, Operations Research Center, 1972-10)Not Available -
On the P-coverage Problem on the Real Line
(Massachusetts Institute of Technology, Operations Research Center, 1991-06)Abstract: In this paper we consider the p-coverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. ...