Browsing Operations Research Center by Title
Research and Teaching Output of the MIT Community
- Home
- →
- Operations Research Center
- →
- Browsing Operations Research Center by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Operations Research Center by Title
-
(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 ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1995)
-
(Massachusetts Institute of Technology, Operations Research Center, 1979-12)
-
(Massachusetts Institute of Technology, 2006)In this thesis we study online optimization problems in routing and scheduling. An online problem is one where the problem instance is revealed incrementally. Decisions can (and sometimes must) be made before all information ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1973-01)
-
(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 ...
-
(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 ...
-
(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 ...
-
(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 ...
-
(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 ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1990)
-
(Massachusetts Institute of Technology, Operations Research Center, 1985)
-
(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 ...
-
(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 ...
-
(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, ...
-
(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 ...
-
(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 ...
-
(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) ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1995)
-
(Massachusetts Institute of Technology, Operations Research Center, 1972-10)Not Available
Browse
My Account
MIT-Mirage