Multiple-attribute decision making with partial information: The comparative hypervolume criterion

A new approach is presented for analyzing multiple-attribute decision problems in which the set of actions is finite and the utility function is additive. The problem can be resolved if the decision makers (or group of decision makers) specifies a set of nonnegative weights for the various attributes or criteria, but we here assume that the decision maker(s) cannot provide a numerical value for each such weight. Ordinal information about these weights is therefore obtained from the decision maker(s), and this information is translated into a set of linear constraints which restrict the values of the weights. These constraints are then used to construct a polytope W of feasible weight vectors, and the subsets H_i (polytopes) of W over which each action a_i has the greatest utility are determined. With the Comparative Hypervolume Criterion we calculate for each action the ratio of the hypervolume of H_i to the hypervolume of W and suggest the choice of an action with the largest such ratio. Justification of this choice criterion is given, and a computational method for accurately approximating the hypervolume ratios is described. A simple example is provided to evaluate the efficiency of a computer code developed to implement the method.     

A mathematical model for generating the area of a drainage basin

This paper presents a mathematical model that yields the area drained by a naturally-occurring network of streams. The model is based on empirically derived relationships in the field of quantitative geomorphology and an assumption concerning the probabilistic nature of stream system formation. A wide range of model solutions is indicated, and the model is validated by comparing the results to statistics from actual stream systems.     

Counterexamples to optimal permutation schedules for certain flow shop problems

It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed.     

On a generalized bin-packing problem

In this paper we address a bin-packing problem which possesses a variety of modifications of the classic theme. Among these are bin-dependent chip weights, bin costs, and bin-dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch-and-bound framework in order to solve the problem after which substantial computational experience is provided.     

A good simple percentile estimator of the weibull shape parameter for use when all three parameters are unknown

In this paper we consider a simple three-order-statistic asymptotically unbiased estimator of the Weibull shape parameter c for the case in which all three parameters are unknown. Optimal quantiles that minimize the asymptotic variance of this estimator, c? are determined and shown to depend only on the true (unknown) shape parameter value c and in a rather insensitive way. Monte Carlo studies further verified that, in practice where the true shape parameter c is unknown, using always c? with the optimal quantities that correspond to c = 2.0 produces estimates, c?, remarkably close to the theoretical optimal. A second stage estimation procedure, namely recalculating c? based on the optimal quantiles corresponding to c?, was not worth the additional effort. Benchmark simulation comparisons were also made with the best percentile estimator of Zanakis [20] and with a new estimator of Wyckoff, Bain and Engelhardt [18], one that appears to be the best of proposed closed-form estimators but uses all sample observations. The proposed estimator, c?, should be of interest to practitioners having limited resources and to researchers as a starting point for more accurate iterative estimation procedures. Its form is independent of all three Weibull parameters and, for not too large sample sizes, it requires the first, last and only one other (early) ordered observation. Practical guidelines are provided for choosing the best anticipated estimator of shape for a three-parameter Weibull distribution under different circumstances.     

On patrolling a channel

A simple formula is found to be just as accurate as a complicated one for estimating the probability of detection achievable by an ingenious searcher patrolling a channel or barrier. The difference between “detection” and “closure” is emphasized in an extension.     

Diagnostic analysis of inventory systems: An optimization approach

The objective of a diagnostic analysis is to provide a measure of performance of an existing system and estimate the benefits of implementing a new one, if necessary. Firms expect diagnostic studies to be done promptly and inexpensively. Consequently, collection and manipulation of large quantities of data are prohibitive. In this paper we explore aggregate optimization models as tools for diagnostic analysis of inventory systems. We concentrate on the dynamic lot size problem with a family of items sharing the same setup, and on the management of perishable items. We provide upper and lower bounds on the total cost to be expected from the implementation of appropriate systems. However, the major thrust of the paper is to illustrate an approach to analyze inventory systems that could be expanded to cover a wide variety of applications. A fundamental by-product of the proposed diagnostic methodology is to identify the characteristics that items should share to be aggregated into a single family.     

The search for an intelligent evader concealed in one of an arbitrary number of regions

This paper considers the search for an evader concealed in one of an arbitrary number of regions, each of which is characterized by its detection probability. We shall be concerned here with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move; his aim is to maximize the expected time to detection, while the searcher attempts to minimize it. The situation where two regions are involved has been studied previously and reported on recently. This paper represents a continuation of this analysis. It is normally true that as the number of regions increases, optimal strategies for both searcher and evader are progressively more difficult to determine precisely. However it will be shown that, generally, satisfactory approximations to each are almost as easily derived as in the two region problem, and that the accuracy of such approximations is essentially independent of the number of regions. This means that so far as the evader is concerned, characteristics of the two-region problem may be used to assess the accuracy of such approximate strategies for problems of more than two regions.     

Multiple-attribute decision making with partial information: The expected-value criterion

We consider the multiple-attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W . Comparisons are made with another criterion already presented, the comparative hyper-volume criterion, and two small examples are presented.     

Optimal state-dependent pricing policies for a class of stochastic multiunit service systems

This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed.