The purpose of this paper is to apply a generalized version of the Farrell measure of technical efficiency to a sample of Illinois strip mines. We disaggregate the original Farrell measure (which was designed to measure lost output or wasted inputs due to underutilization of inputs) into three...

Many Linear Programming (LP) practitioners formulate and document their models with block schematics of LP matrices. They subscribe to neither the column-wise emphasis of commercial matrix generators nor to the constraint orientation of recently proposed "modelling languages." PAM is a...

A new linear programming formulation for handling categorical outputs in DEA is presented which eliminates the difficulties of interpretation and computation that accompanied earlier mixed integer models.

Deterministic inventory theory provides streamlined optimization models that attempt to capture trade-offs in managing the flow of goods through a supply chain. We will consider two well-studied deterministic inventory models, called the one-warehouse multiretailer (OWMR) problem and its special...

We present a variant of Karmarkar's algorithm for block-angular structured linear programs, such as stochastic linear programs. By computing the projection efficiently, we give a worst-case bound on the order of the running time that can be an order of magnitude better than that of Karmarkar's...

We attempt to unify a linear programming model with a rule-based system via overlapped decision variables. Since a rule base can be regarded as an acyclic AND/OR digraph, the unified model is virtually a multiobjective decision making problem that considers both numeric and symbolic objectives...

In this paper we present an algorithm for solving infinite-horizon discounted Markov games based upon the fact that the value function is a least element of a superharmonic set. The algorithm produces a pair of policies whose value function is within a specified error of the solution to the...

This paper discusses the selection and design of heuristic procedures for solving one-dimensional roll trim problems. These are well-defined combinatorial problems which are too large to optimize. Five different roll trim problems from the paper and film industries are described along with the...

We propose and test a new pricing procedure for solving large-scale structured linear programs. The procedure interactively solves a relaxed subproblem to identify potential entering basic columns. The subproblem is chosen to exploit special structure, rendering it easy to solve. The effect of...

As databases grow more prevalent and comprehensive, database administrators seek to limit disclosure of confidential information while still providing access to data. Practical databases accommodate users with heterogeneous needs for access. Each class of data user is accorded access to only...