Operations Research articles from November 2001

Operations Research archives from November 2001

An illustrative application of idea (imprecise data envelopment analysis) to a Korean mobile telecommunication company.
November 1, 2001... Data Envelopment Analysis (DEA) models, as ordinarily employed, assume that the data for all inputs and outputs are known exactly. In some applications, however, a number of factors may involve imprecise data, which take forms such as ordinal...

Alternative models of restructured electricity systems, Part 1: no market power.
November 1, 2001... Different equilibrium concepts have been proposed by various authors (Schweppe et al., Hogan et al., Chao and Peck, Wu et al.) to analyse competitive electricity systems. We establish correspondences between these different models through a...

Near-optimal pricing and replenishment strategies for a retail/distribution system.
November 1, 2001... This paper integrates pricing and replenishment decisions for the following prototypical two-echelon distribution system with deterministic demands. A supplier distributes a single product to multiple retailers, who in turn sell it to...

Generating experimental data for computational testing with machine scheduling applications.
November 1, 2001... The operations research literature provides little guidance about how data should be generated for the computational testing of algorithms or heuristic procedures. We discuss several widely used data generation schemes, and demonstrate that...

Generating experimental data for the generalized assignment problem.
November 1, 2001... The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jobs to machines such that each job is assigned to exactly one machine, subject to capacity restrictions on the machines. We propose a new...

High-performance computing for asset-liability management.
November 1, 2001... Financial institutions require sophisticated tools for risk management. For companywide risk management, both sides of the balance sheet should be considered, resulting in an integrated asset-liability management approach. Stochastic...

Optimal transmission policies for noisy channels.(single wireless link to base station)
November 1, 2001... We consider transmission policies for multiple users sharing a single wireless link to a base station. The noise, and hence the probability of correct transmission of a packet, depends on the state of the user receiving the packet. The state...

Importance sampling and the cyclic approach.
November 1, 2001... The method of importance sampling is widely used for efficient rare-event simulation of stochastic systems. This method involves simulating the system under a new distribution that accentuates the probability along the most likely paths to the...

A min-max-sum resource allocation problem and its applications.
November 1, 2001... In this paper we consider a class of discrete resource-allocation problems with a min-max-sum objective function. We first provide several examples of practical applications of this problem. We then develop a branch-and-bound procedure for...

Conditioning on one-step survival for barrier option simulations.
November 1, 2001... Pricing financial options often requires Monte Carlo methods. One particular case is that of barrier options, whose payoff may be zero depending on whether or not an underlying asset crosses a barrier during the life of the option. This paper...

A dynamic airline seat inventory control model and its optimal policy.
November 1, 2001... We consider an airline seat inventory control problem with multiple origins, one hub, and one destination. Passengers from the origins fly to the destination via the hub. Seat capacity of the hub-destination flight is fixed. Demands at origins...

Simple procedures for selecting the best simulated system when the number of alternatives is large.
November 1, 2001... In this paper, we address the problem of finding the simulated system with the best (maximum or minimum) expected performance when the number of alternatives is finite, but large enough that ranking-and-selection (R&S) procedures may require...

A multiplicative decomposition property of the screening-and-selection procedures of Nelson et al.
November 1, 2001... Recently, Nelson et al. (2001a, b) formulated a class of combined screening-and-selection procedures for identifying the simulated system with optimal expected response when the number of alternatives is finite, but large enough to render...