摘要:

AbstractOn‐site verification of ICBMs in the context of an arms control agreement might involve a situation where an inspector would choose one or more of a number of identical areas to inspect and would have confidence that the other areas had the same characteristics. This article considers optimal attack and defense of missiles deceptively based in a number of identical areas. The attacker may allocate warheads across areas as he desires and uniformly within areas. The defender may allocate interceptors across areas as he desires and either uniformly or preferentially within areas. The effect of restricting the defender to uniform allocation across areas is explored for various assumptions. Robustness of surviving missiles with respect to the number of attacking warheads is studied. Results are presented for a wide range of case

ISSN:0028-1441    

DOI:10.1002/nav.3800320202

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

年代:1985

数据来源: WILEY

摘要:

AbstractWe perform a sensitivity analysis of the Euclidean, single‐facility minisum problem, which is also known as the Weber problem. We find the sensitivity of the optimal site of the new facility to changes in the locations and weights of the demand points. We apply these results to get the optimal site if some of the parameters in the problem are changed. We also get approximate formulas for the set of all possible optimal sites if demand points are restricted to given areas, and weights must be within given ranges, which is a location problem under conditions of uncertaint

ISSN:0028-1441    

DOI:10.1002/nav.3800320203

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

年代:1985

数据来源: WILEY

摘要:

AbstractThe mathematical theory necessary to solve combined arms models of military combat is presented here. We show how to apply the theory of positive operators to such models. Most of the results are purely qualitative in character showing that many properties of such systems are independent of the actual numerical values of the coefficients. Finally, we discuss in some detail an example of such a system.

ISSN:0028-1441    

DOI:10.1002/nav.3800320204

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

年代:1985

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800320205

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

年代:1985

数据来源: WILEY

摘要:

AbstractThis article describes a new procedure for estimating parameters of a stochastic activity network ofNarcs. The parameters include the probability that pathmis the longest path, the probability that pathmis the shortest path, the probability that arciis on the longest path, and the probability that arciis on the shortest path. The proposed procedure usesquasirandom pointstogether with information on acutsetℋ of the network to produce an upper bound ofO[(logK)N−|ℋ|+1/K] on the absolute error of approximation, whereKdenotes the number of replications. This is a deterministic bound and is more favorable than the convergence rate of 1/K1/2that one obtains from the standard error forKindependent replications using random sampling. It is also shown how series reduction can improve the convergence rate by reducing the exponent on logK. The technique is illustrated using a Monte Carlo sampling experiment for a network of 16 relevant arcs with a cutset of ℋ = 7 arcs. The illustration shows the superior performance of using quasirandom points with a cutset (plan A) and the even better performance of using quasirandom points with the cutset together with series reduction (plan B) with regard to mean square error. However, it also shows that computation time considerations favor plan A whenKis small and plan B whenKi

ISSN:0028-1441    

DOI:10.1002/nav.3800320206

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

年代:1985

数据来源: WILEY

摘要:

AbstractA search model is formulated in which positive information may be obtained, through the detection of trails, as to the target's earlier whereabouts. The corresponding Bayesian update formulas for target location probabilities are derived. The model does not appear to be amenable to rigorous optimization. A moving‐horizon rule, and a heuristic simplification thereof, are, however, derived. In two numerical examples it is demonstrated that actively designing for detecting trail information, through use of these moving‐horizon rules, has substantial potential advantage over using, for example, myopic rules even if the positive information is adaptively incorporated into location probabilities before applying the latter rules in each time per

ISSN:0028-1441    

DOI:10.1002/nav.3800320207

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

年代:1985

数据来源: WILEY

摘要:

AbstractIn this article the control of entry of customers to a queuing system withsservers is considered. It is assumed that the arrivals form a nonstationary Poisson process with a periodic rate. The service times are assumed to be exponentially distributed with a parameter independent of time. The cost structure considered is the same as that of Naor. It is demonstrated numerically that, like the stationary cases, the average expected benefit of customers per unit of time is a unimodal function of the critical point. And, also, the social critical point is smaller than the individual critical point. These suggest the use of a search technique for finding the social critical point. The results show successful application of the discrete version of the Fibonacci search.

ISSN:0028-1441    

DOI:10.1002/nav.3800320208

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

年代:1985

数据来源: WILEY

摘要:

AbstractA service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/cqu

ISSN:0028-1441    

DOI:10.1002/nav.3800320209

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

年代:1985

数据来源: WILEY

摘要:

AbstractThis article compares two types of approximating strategies for solving some continuous review inventory models noniteratively. One of these strategies is to approximate the normalized loss integral by an exponential function whereas the other strategy is to estimate the loss integral as a quadratic function of the right‐tail probability. It is found that the latter method is significantly more accurate and versatile than the former method. Theoretical arguments are given to emphasize that both the right‐tail probability and the loss integral are key functions involved in those models. Therefore, a good strategy should be not only to estimate these two functions, but also to retain the interrelationships between them. The quadratic method is better than the exponential method primarily because of the latter prope

ISSN:0028-1441    

DOI:10.1002/nav.3800320210

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

年代:1985

数据来源: WILEY

摘要:

AbstractThe problem treated here involves a mixed fleet of vehicles comprising two types of vehicles:K1tanker‐type vehicles capable of refueling themselves and other vehicles, andK2nontanker vehicles incapable of refueling. The two groups of vehicles have different fuel capacities as well as different fuel consumption rates. The problem is to find the tanker refueling sequence that maximizes the range attainable for theK2nontankers. A tanker refueling sequence is a partition of the tankers intomsubsets (2 ≤m≤K1). A given sequence of the partition provides a realization of the number of tankers participating in each successive refueling operation. The problem is first formulated as a nonlinear mixed‐integer program and reduced to a linear program for a fixed sequence which may be solved by a simple recursive procedure. It is proven that a “unit refueling sequence” composed of one tanker refueling at each ofK1refueling operations is optimal. In addition, the problem of designing the “minimum fleet” (minimum number of tankers) required for a given set ofK2nontankers to attain maximal range is resolved. Also studied are extensions to the problem with a constraint on the number of refueling operations, different nontanker recovery base geometry, and refueling on

ISSN:0028-1441    

DOI:10.1002/nav.3800320211

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

年代:1985

数据来源: WILEY