Browsing Operations Research Center by Title
Now showing items 313-332 of 372
-
Sensitivity analysis of the Brookhaven energy system optimization model
(Massachusetts Institute of Technology, Operations Research Center, 1977) -
Sensitivity Analysis of the Economic Lot-Sizing Problem
(Massachusetts Institute of Technology, Operations Research Center, 1990-11)In this paper we study sensitivity analysis of the uncapacitated single level economic lot-sizing problem, which was introduced by Wagner and Whitin about thirty years ago. In particular we are concerned with the computation ... -
Separable Concave Optimization Approximately Equals
(2006-03-13) -
Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization
(Massachusetts Institute of Technology, Operations Research Center, 2012-01-18) -
Sequential Event Prediction
(Massachusetts Institute of Technology, Operations Research Center, 2012-08-29) -
Shortest Path Algorithms: A Comparison
(Massachusetts Institute of Technology, Operations Research Center, 1975-10)In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks. -
Shortest Paths, Network Design and Associated Polyhedra
(Massachusetts Institute of Technology, Operations Research Center, 1990-04)We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network ... -
Single Machine Scheduling with Release Dates
(Massachusetts Institute of Technology, Operations Research Center, 1999-10)We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a ... -
Solution of the Retiring Search Problem
(Massachusetts Institute of Technology, Operations Research Center, 1977-12)The well-known variational principle of the optimal distribution of search effort is applied to the case where the sought-for target has been located momentarily but the search cannot begin until a time T o later, during ... -
Solving variational inequality and fixed point problems by averaging and optimizing potentials
(Massachusetts Institute of Technology, Operations Research Center, 1997) -
Some Abstract Pivot Algorithms
(Massachusetts Institute of Technology, Operations Research Center, 1974-02)Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ... -
Some Abstract Pivot Algorithms (REVISED)
(Massachusetts Institute of Technology, Operations Research Center, 1974-08)Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ... -
Some Characterizations and Properties of the "Distance to Ill-Posedness" and the Condition Measure of a Conic Linear System
(Massachusetts Institute of Technology, Operations Research Center, 1995-10)A conic linear system is a system of the form P: find x that solves b- Ax E Cy, E Cx, where Cx and Cy are closed convex cones, and the data for the system is d = (A, b). This system is"well-posed" to the extent that (small) ... -
Some lattice-theoretic tools for network reliability analysis
(Massachusetts Institute of Technology, Operations Research Center, 1985) -
Some Recent Advances in Network Flows
(Massachusetts Institute of Technology, Operations Research Center, 1989-10)The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems. However, the surge of activity on the ... -
A Splitting Equilibration Algorithm for the Computation of Large-Scale Constrained Matrix Problems; Theoretical Analysis and Applications
(Massachusetts Institute of Technology, Operations Research Center, 1990-07)In this paper we introduce a general parallelizable computational method for solving a wide spectrum of constrained matrix problems. The constrained matrix problem is a core problem in numerous applications in economics. ... -
Stability conditions for multiclass fluid queueing networks
(Massachusetts Institute of Technology, Operations Research Center, 1995) -
A Statistical Approach to the TSP
(Massachusetts Institute of Technology, Operations Research Center, 1976-04)This paper is an example of the growing interface between statistics and mathematical optimization. A very efficient heuristic algorithm for the combinatorially intractable TSP is presented, from which statistical estimates ... -
Steepest Ascent Decomposition Methods for Mathematical Programming/Economic Equilibrium Energy Planning Models
(Massachusetts Institute of Technology, Operations Research Center, 1976-02)A number of energy planning models have been proposed for combining econometric submodels which forecast the supply and demand for energy commodities with a linear programming submodel which optimizes the processing and ... -
A stochastic and dynamic vehicle routing problem in the Euclidean plane
(Massachusetts Institute of Technology, Operations Research Center, 1990)
