摘要:

AbstractA series of independent trials is considered in which one ofk≥ 2 mutually exclusive and exhaustive outcomes occurs at each trial. The series terminates when m outcomes of any one type have occurred. The limiting distribution (as m → ∞) of the number of trials performed until termination is found with particular attention to the situation where a Dirichlet distribution is assigned to thekvector of probabilities for each outcome. Applications to series of races involvingkrunners and to spares problems in reliability modeling are discussed. The problem of selecting a stopping rule so that the probability of the series terminating on outcomeiisk−1(i.e., a “fair” competition) is also studied. Two generalizations of the original asymptotic problem ar

ISSN:0028-1441    

DOI:10.1002/nav.3800300102

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractThis article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly‐ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current metho

ISSN:0028-1441    

DOI:10.1002/nav.3800300103

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractComputational formulas are given for the mean, variance, and autocorrelation function of the demand process at an upper‐echelon facility (warehouse). The demand process at the warehouse is induced by the aggregated inventory replenishment processes ofNindependently operated lower‐echelon facilities (stores) in parallel. Each store, we assume, employs an (s,S) inventory replenishment policy with complete backlogging to satisfy its own random, independently and identically distributed demand. The formulas result from an analysis of the stochastic replenishment process at a single store. Examples of the properties of the demand process at the upper‐echelon facility are presented for several lower‐echelon envir

ISSN:0028-1441    

DOI:10.1002/nav.3800300104

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractApproaches are considered for the reduction of coefficients in linear integer inequalities. It is shown that coefficients may be reduced easily in many practical examples. The (0‐1) problem is also reconsidered and certain areas of exploration develope

ISSN:0028-1441    

DOI:10.1002/nav.3800300105

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractConstrained multi‐item inventory models have long presented signifcant computational problems. This article presents a general algorithm to obtain simultaneous solutions for order quantities and safety stocks for each line item in an inventory, while satisfying constraints on average inventory investment and reordering workload. Computational experience is presented that demonstrates the algorithm's efficiency in handling large‐scale applications. Decision rules for several customer service objectives are developed, with a discussion of the characteristics of the inventory systems in which each objective would be most appropriate. The decision rules are approximations, based on the assumptions commonly used in pract

ISSN:0028-1441    

DOI:10.1002/nav.3800300106

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractDuring the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst‐case bound

ISSN:0028-1441    

DOI:10.1002/nav.3800300107

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractThis article describes a multifacility capacity expansion model in which the different facility types represent different quality levels. These facility types are used to satisfy a variety of deterministic demands over a finite number of discrete time periods. Applications for the model can be found in cable sizing problems associated with the planning of communication networks. It is assumed that the cost function associated with expanding the capacity of any facility type is concave, and that a joint set‐up cost is incurred in any period in which one or more facilities are expanded. The model is formulated as a network flow problem from which properties associated with optimal solutions are derived. Using these properties, we develop a dynamic programming algorithm that finds optimal solutions for problems with a few facilities, and a heuristic algorithm that finds near‐optimal solutions for larger problems. Numerical examples for both algorithms are discus

ISSN:0028-1441    

DOI:10.1002/nav.3800300108

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractThis article considers combat between two homogeneous forces modeled by variable‐ coefficient Lanchester‐type equations of modern warfare and develops new “simple‐approximate” battle‐outcome‐prediction conditions for military engagements terminated by two different types of prescribed conditions being met (fixed‐force‐level‐breakpoint battles and fixed‐force‐ratio‐breakpoint battles). These battle‐outcome‐prediction conditions are sufficient (but not necessary) to determine the outcome of battle without having to explicitly compute the force‐level trajectories, and they are characterized by their simplicity, requiring no advanced mathematical knowledge or tabulations of “special functions” for their application. Integrability properties of the Lanchester attrition‐rate coefficients figure prominently in their results, and involved in their development is a generalization of Lanchester's famous square law to variable‐coefficient Lanchester‐type combat and several other novel mathematical developments for the analysis of ordinary differential equations. Examples are given, with the attack of a mobile force against a static defensive position (both sides armed with weapons whose firepower is

ISSN:0028-1441    

DOI:10.1002/nav.3800300109

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractIn this article we present an all‐integer cutting plane algorithm called the Reduced Advanced Start Algorithm (RASA). The technique incorporates an infeasible advanced start based on the optimal solution to the LP relaxation, and initially discards nonbinding constraints in this solution. We discuss the results of computational testing on a set of standard problems and illustrate the operation of the algorithm with three small example

ISSN:0028-1441    

DOI:10.1002/nav.3800300110

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY

摘要:

AbstractIn this article we present some advanced basis or block‐pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex‐based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattract

ISSN:0028-1441    

DOI:10.1002/nav.3800300111

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1983

数据来源: WILEY