Browsing Operations Research Center Working Papers by Title
Now showing items 262281 of 372

Parallel Computation of LargeScale Dynamic Market Network Equilibria via Time Period Decomposition
(Massachusetts Institute of Technology, Operations Research Center, 199007)In this paper we consider a dynamic market equilibrium problem over a finite time horizon in which a commodity is produced, consumed, traded, and inventoried over space and time. We first formulate the problem as a network ... 
Parallel Computation of LargeScale Nonlinear Network Problems in the Social and Economic Sciences
(Massachusetts Institute of Technology, Operations Research Center, 199007)In this paper we focus on the parallel computation of large  scale equilibrium and optimization problems arising in the social and economic sciences. In particular, we consider problems which can be visualized and ... 
Parameter Shortest Path Algorithms with an Application to Cyclic Staffing
(Massachusetts Institute of Technology, Operations Research Center, 198010)Let G = (V,E) be a digraph with n vertices including a special vertex s. Let E' C E be a designated subset of edges. For each e E E there is an associated real number fl(e). Furthermore, let 1 if e E E' f2(e): 0 if e EE' ... 
Parametric Integer Programming: The RightHandSideCase
(Massachusetts Institute of Technology, Operations Research Center, 197603)A family of integer programs is considered whose righthandsides lie on a given line segment L. This family is called a parametric integer program(PIP). Solving a (PIP) means finding an optimal solution for every program ... 
Parametric linear programming and anticycling pivoting rules
(Massachusetts Institute of Technology, Operations Research Center, 1985) 
Parametric Linear Programming and AntiCycling Pivoting Rules
(Massachusetts Institute of Technology, Operations Research Center, 198510)The traditional perturbution (or lexicographic) methods for resolving degeneracy in linear programming impose decision rules that eliminate ties in the simplex ratio rule and, therefore,restrict the choice of exiting basic ... 
The parsimonious property of cut covering problems and its applications
(Massachusetts Institute of Technology, Operations Research Center, 1994) 
A PCoriented interactive tool for finding efficient solutions to emergency planning problems
(Massachusetts Institute of Technology, Operations Research Center, 1988) 
Performance Bounds for Scheduling Queueing Networks
(Massachusetts Institute of Technology, Operations Research Center, 199009)The goal of this paper is to assess the improvement in performance that might' be achieved by optimally scheduling a multiclass open queueing network. A stochastic process is defined whose steadystate mean value is less ... 
Planning Investments in Water Resources by MixedInteger Programming: The VardarAxios River Basin
(Massachusetts Institute of Technology, Operations Research Center, 197803)A mixed integer programming model for planning water resources investments is presented. The model is a sequencing model applied to the VardarAxios river basin in Yugoslavia and Greece. The structure of the model is ... 
A Polyhedral Intersection Theorem for Capacitated Spanning Trees
(Massachusetts Institute of Technology, Operations Research Center, 198912)In a twocapacitated spanning tree of a complete graph with a distinguished root vertex v, every component of the induced subgraph on V\{v} has at most two vertices. We give a complete,nonredundant characterization of the ... 
Polyhedral properties of the network restoration problemwith the convex hull of a special case
(Massachusetts Institute of Technology, Operations Research Center, 1997) 
Polynomialtime algorithms for linear programming based only on primal scaling and projected gradients of a potential function
(Massachusetts Institute of Technology, Operations Research Center, 1988) 
Posterior Inference for Structural Parameters Using Cross Section and Time Series Data
(Massachusetts Institute of Technology, Operations Research Center, 197112)Not Available 
The potential impact of expert systems in urban police services
(Massachusetts Institute of Technology, Operations Research Center, 1985) 
A Potential Reduction Algorithm With UserSpecified Phase I  Phase II Balance, for Solving a Linear Program from an Infeasible Warm Start
(Massachusetts Institute of Technology, Operations Research Center, 199110)This paper develops a potential reduction algorithm for solving a linearprogramming problem directly from a "warm start" initial point that is neither feasible nor optimal. The algorithm is of an "interior point" variety ... 
A potentialfunction reduction algorithm for solving a linear program directly from an infeasible "warm start"
(Massachusetts Institute of Technology, Operations Research Center, 1989) 
PreConditioners and Relations between Different Measures of Conditioning for Conic Linear Systems
(Massachusetts Institute of Technology, Operations Research Center, 200006)In recent years, new and powerful research into "condition numbers" for convex optimization has been developed, aimed at capturing the intuitive notion of problem behavior. This research has been shown to be important in ... 
Preliminary Survey of Classical Statistical Techniques for Incorporation into Adaptive Evaluation Methodology
(Massachusetts Institute of Technology, Operations Research Center, 198102)Evaluation of public programming currently tends toward plans that are set in advance of any sampling and adhered to throughout. Because increments in the knowledge profile during the course of an evaluation might beckon ... 
The Price of Anarchy Under Nonlinear and Asymmetric Costs
(Massachusetts Institute of Technology, Operations Research Center, 200312)In this paper we characterize the "price of anarchy", i.e., the inefficiency between user and system optimal solutions, when costs are nonseparable, asymmetric and nonlinear, generalizing earlier work that has addressed ...