A differential equation model of search for randomly arriving and departing targets

In this paper we analyze optimal search strategies in an environment in which multiple, independent targets arrive and depart at random. The analysis revolves around a continuous time differential equation model which captures the time dependent nature of the search process. We explore the impact on optimal strategies of nonzero travel times between regions as well as differing target arrival rates. We derive simple closed form expressions for determining if only one region should be searched.     

Maximal nash subsets for bimatrix games

In this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived.     

An F approximation for two-parameter weibull and log-normal tolerance bounds based on possibly censored data

An approximation suggested in Mann, Schafer and Singpurwalla [18] for obtaining small-sample tolerance bounds based on possibly censored two-parameter Weibull and lognormal samples is investigated. The tolerance bounds obtained are those that effectively make most efficient use of sample data. Values based on the approximation are compared with some available exact values and shown to be in surprisingly good agreement, even in certain cases in which sample sizes are very small or censoring is extensive. Ranges over which error in the approximation is less than about 1 or 2 percent are determined. The investigation of the precision of the approximation extends results of Lawless [8], who considered large-sample maximum-likelihood estimates of parameters as the basis for approximate 95 percent Weibull tolerance bounds obtained by the general approach described in [18]. For Weibull (or extreme-value) data the approximation is particularly useful when sample sizes are moderately large (more than 25), but not large enough (well over 100 for severely censored data) for asymptotic normality of estimators to apply. For such cases simplified efficient linear estimates or maximum-likelihood estimates may be used to obtain the approximate tolerance bounds. For lognormal censored data, best linear unbiased estimates may be used, or any efficient unbiased estimators for which variances and covariances are known as functions of the square of the distribution variance.     

A bayesian approach to evaluating military investments in product improvement and testing

Two issues of frequent importance in new product development are product improvement and reliability testing. A question often faced by the developer is: Should the product be distributed in its present state, or should it be improved further and/or tested before distribution? A more useful statement of the question might be: What levels of investment in further improvement and testing are economically permissible? Products for which this question is relevant may vary widely in type and intended use. This paper presents a model for determining these levels for one such product—an equipment modification procedure. The model presented makes use of present value analysis to compare cost streams and of Bayesian statistics to relate the costs to various outcomes under conditions of uncertainty. The model is applied to an actual military problem and a method is described for examining the sensitivity of the results to changes in the prior probabilities and discount rate.     

Multiobjective fractional programming duality theory

Results of Geoffrion for efficient and properly efficient solutions of multiobjective programming problems are extended to multiobjective fractional programming problems. Duality relationships are given for these problems where the functions are generalized convex or invex.     

Volume discount decisions: Wealth maximization or EOQ approach?

A recent paper finds that when volume discounts are available, in some cases, reliance on the Economic Order Quantity (EOQ) model can induce purchasers to make wealth reducing decisions, and the Present Value (PV) approach should be preferred. While this finding is theoretically correct, the magnitudes of wealth reductions suggested by the paper's numerical examples seem to be questionable. Furthermore, the paper also finds that, in some other cases, a purchaser using the EOQ approach realizes a net increase in current wealth compared to a purchaser using the PV approach. Logic suggests that such a finding cannot be correct, since by its very definition, it is the PV approach that seeks to maximize the current wealth. We offer an alternative frame of comparison and a modified model to show that, under the paper's assumptions, the EOQ approach can never realize a net increase in current wealth compared to the current wealth generated by the PV approach. On the other hand, we also show that when typical values of the relevant parameters prevail, the additional costs imposed by the EOQ approach are not significant. Finally, we suggest that insofar as the PV approach requires greater administrative costs to implement, it may even be counterproductive to the goal of wealth maximization. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 377–389, 1998     

Branch and bound methods for a search problem

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch and Bound methods, with emphasis on the tradeoff between the accuracy of the bound employed and the time required to compute it. A variety of bounds are investigated, some of which are new. In most cases the best bounds turn out to be imprecise, but very easy to compute. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 243–257, 1998     

Waiting times for M/G/1 queues with service-time or delay-dependent server vacations

This article shows how to determine the stationary distribution of the virtual wait in M/G/1 queues with either one-at-a-time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately preceding service time or of whether the server finds the system empty after returning from vacation. In this way, it is possible to model situations such as long service times followed by short vacations, and vice versa. For the second type of dependence, the vacation time assigned to an arrival to follow its service is a function of the level of virtual wait reached. By this device, we can model situations in which vacations may be shortened whenever virtual delays have gotten excessive. The method of analysis employs level-crossing theory, and examples are given for various cases of service and vacation-time distributions. A closing discussion relates the new model class to standard M/G/1 queues where the service time is a sum of variables having complex dependencies. © 1992 John Wiley & Sons, Inc.     

Economic lot scheduling of fully loaded processes with external setups

Without restricting the class of permissible schedules, we derive optimal schedules for economic lot scheduling problems that are fully loaded, have external setups, and have only two products. The fully loaded condition accurately represents certain types of bottlenecks. We show that the optimal schedule must have the Wagner-Whitin property. We also develop a measure of aggregate inventory, derive an optimal steady-state aggregate inventory policy, and provide conditions under which the aggregate inventory level of an optimal schedule must approach a steady state. By restricting the class of permissible schedules to rotation cycle schedules, we extend these results to more than two products.