摘要:

AbstractThe present paper provides a proof that the Bayes prediction ordering policy developed in [3] is an optimal policy, in the sense that it minimizes the total expected discounted cost of ordering for any finite planning horizon.

ISSN:0028-1441    

DOI:10.1002/nav.3800210402

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

年代:1974

数据来源: WILEY

摘要:

AbstractThe present paper extends the results of [7] to cases of multistation lower echelon. For this purpose an algorithm for the optimal allocation of the upper echelon stock among the lower echelon stations is developed. The policy of ordering for the upper echelon is an extension of the Bayes prediction policy developed in [7]. Explicit formulae are presented for the execution of this policy. Several simulation runs are presented and analyzed for the purpose of obtaining information on the behavior of the system, under the above control policy, over short and long periods.

ISSN:0028-1441    

DOI:10.1002/nav.3800210403

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

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper develops a method for doing postoptimality analysis on the mixed integer programming problem. The proposed procedures form a natural adjunct to enumerative I.P. algorithms that are linear programming based, and they are designed, in effect, to capitalize on insights generated as the problem is initially solved to do subsequent analysis upon it. In particular, limited ranging analysis is possible on selected parameters, as is the efficient resolving of the problem following parameter changes.

ISSN:0028-1441    

DOI:10.1002/nav.3800210404

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

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper introduces an efficient heuristic procedure for solving a special class of mixed integer programming problem called the capacitated warehouse (plant) location problem. This procedure parallels the work reported earlier in [9] on the uncapacitated warehouse location problem. The procedure can be viewed as tracing a judiciously selected path of the branch and bound tree (from the initial node to the terminal node) to arrive at a candidate solution. A simple backtracking scheme is also incorporated in the procedure to investigate possible improvement in the solution. Computational results on problems found in the literature look quite encouraging.

ISSN:0028-1441    

DOI:10.1002/nav.3800210405

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

年代:1974

数据来源: WILEY

摘要:

AbstractIn many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed.

ISSN:0028-1441    

DOI:10.1002/nav.3800210406

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

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11]to develop a primal code for the well‐known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code develope

ISSN:0028-1441    

DOI:10.1002/nav.3800210407

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

年代:1974

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800210408

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

年代:1974

数据来源: WILEY

摘要:

AbstractThe output of the queueing systemM/M/1 is well known to be Poisson. This has also been shown to be true for other more general models inclusive ofM/Mn/1; the system in which arrivals and epochs of service completion are elements of a birth and death process with parameters Λ and nμ, respectively, when the system contains n ≥ 1 customers. We shall here show that this result is not true inMnM/1; a system where arrival parameter is state dependent quantity Λ/n+1. Expressions will be given for the steady state joint density of two consecutive output intervals as well as the coefficient of correlation between

ISSN:0028-1441    

DOI:10.1002/nav.3800210409

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

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper presents a model for choosing a minimum‐cost mix of strategic defenses to assure that specified production capacities for several economic sectors survive after a nuclear attack. The defender selects a mix of strategic defenses for each of several geographic regions. The attacker chooses an allocation of attacking weapons to geographic regions, within specified weapon inventories. The attack is optimized against any economic sector. This formulation allows the defense planner the capability to assess the results of the optimal defense structure for a “worst case” attack. The model is a mathematical program with nonlinear programming problems in the constraints; an example of its application is given and is solved using recently developed optimization techn

ISSN:0028-1441    

DOI:10.1002/nav.3800210410

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

年代:1974

数据来源: WILEY

摘要:

AbstractIn any model for a sonar detection process, some assumption must be made about the nature of the acoustic fluctuation process. Two processes that are widely used in this role are the jump process and the Gauss‐Markov process. These processes are similar in that they are both stationer) Markov processes and have autocovariance functions of the form s̀2exp(—γt). For these reasons, it might be believed that one could use either of these processes and get comparable results if all one is interested in is computing cumulative detection probabilities or mean time to gain or lose contact. However, such is not the case in that vastly different results can be obtained in some applications. An application of this sort is presented. We also present necessary and sufficient conditions for a threshold to have the property that it is almost surely crossed by the jump process, or by the Gauss‐Markov process. This affords another method of com

ISSN:0028-1441    

DOI:10.1002/nav.3800210411

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

年代:1974

数据来源: WILEY