Browsing Operations Research Center by Title
Now showing items 293-312 of 372
-
Projective Transformations for Interior Point Methods, Part II: Analysis of An Algorithm for Finding the Weighted Center of a Polyhedral System
(Massachusetts Institute of Technology, Operations Research Center, 1988-06)In Part II of this study, the basic theory of Part I is applied to the problem of finding the w-center of a polyhedral system X . We present a projective transformation algorithm, analagous but more general than Karmarkar's ... -
Punishment policies' effect on illicit drug users' purchasing habits
(Massachusetts Institute of Technology, Operations Research Center, 1989) -
Pup Matching: Model Formulations and Solution Approaches
(Massachusetts Institute of Technology, Operations Research Center, 2003-02)We model Pup Matching, the logistics problem of matching or pairing semitrailers known as pups to cabs that are able to tow one or two of the pups simultaneously, as an AfP-complete version of the Network Loading Problem ... -
A queuing theory, Bayesian model for the circulation of books in a library
(Massachusetts Institute of Technology, Operations Research Center, 1977) -
A Rational Approach to Governmental Decision Concerning Air Pollution
(Massachusetts Institute of Technology, Operations Research Center, 1971-08)This paper addresses a problem common to many government agencies--trying to specify a regulatory policy that is in some sense best for a given situation. Such questions demand the consideration of multiple conflicting ... -
Reference guide to the framework presented in "Implementing reusable solvers : an objected-oriented framework for operations research algorithms"
(Massachusetts Institute of Technology, Operations Research Center, 1998) -
A response time estimator for police patrol dispatching
(Massachusetts Institute of Technology, Operations Research Center, 1984) -
Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic
(Massachusetts Institute of Technology, Operations Research Center, 1994-08)We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless bandits in stochastic optimization. We introduce a series of n increasingly stronger linear programming relaxations, the ... -
Return on Investment Analysis for Facility Location
(Massachusetts Institute of Technology, Operations Research Center, 1991-05)We consider how the optimal decision can be made if the optimality criterion of maximizing profit changes to that of maximizing return on investment for the general uncapacitated facility location problem. We show that the ... -
Risk Independence and Multiattributed Utility Functions
(Massachusetts Institute of Technology, Operations Research Center, 1971-06)The concepts of conditional risk aversion, the conditional risk premium, and risk independence pertaining to multiattributed utility functions are defined. The latter notion is then generalized to what is called utility ... -
Routing and Scheduling on a Shoreline with Release Times
(Massachusetts Institute of Technology, Operations Research Center, 1986-09)In this paper we examine computational complexity issues and develop algorithms for a class of "shoreline" single-vehicle routing and scheduling problems with release time constraints. Problems in this class are interesting ... -
Routing in Point-to-Point Delivery Systems
(Massachusetts Institute of Technology, Operations Research Center, 1988-01)We develop an optimization-based approach for a point-to-point route planning problem that arises in many large scale delivery systems(for example, less-than-truckload freight, rail, mail and package delivery, communications). ... -
Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points
(Massachusetts Institute of Technology, Operations Research Center, 1992-09)A single machine produces several different classes of items in a make-to-stock mode. We consider the problem of scheduling the machine to regulate finished goods inventory, minimizing holding and backorder or holding and ... -
Scheduling Manufacturing Systems With Work-in-Process Inventory Control: Single-Part-Type Systems
(Massachusetts Institute of Technology, Operations Research Center, 1990-06)In this paper, a real-time feedback control algorithm is developed for scheduling single-part-type production lines in which there are three important classes of activities: operations, failures, and starvation or blockage. ... -
Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
(Massachusetts Institute of Technology, Operations Research Center, 1990-07)We consider the problem of finding an optimal dynamic priority sequencing policy to maximize the mean throughput rate in a multistation, multiclass closed queueing network with general service time distributions and a ... -
Scheduling Workforce and Workflow in a Service Factory
(Massachusetts Institute of Technology, Operations Research Center, 1994-02)We define a service factory to be a network of service-related-workstations, at which assigned workers process work-in-progress that flows through the workstations. Examples of service factory work include mail processing ... -
Sensitivity analysis for variational inequalities
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
Sensitivity analysis for variational inequalities defined on polyhedral sets
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
Sensitivity Analysis in Integer Programming
(Massachusetts Institute of Technology, Operations Research Center, 1976-02)Not Available -
Sensitivity Analysis of List Scheduling Heuristics
(Massachusetts Institute of Technology, Operations Research Center, 1990-10)When jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list ...
