Bayes adaptive control policies are developed in the present paper for the special case of a one-station lower echelon: a Poisson distribution of demand, whose mean is assumed to have a prior gamma distribution. The cost structure is of a common type. The ordering policy for the upper echelon, which minimizes expected cost, is replaced by a new type of policy, called Bayes prediction policy. This policy does not require tedious computations, of the sort required by dynamic programming solutions. The characteristics of the policies are studied by Monte Carlo simulation, and supplemented by further theoretical development. 相似文献
Industrial situations exist where it is necessary to estimate the optimum number of parts to start through a manufacturing process in order to obtain a given number of completed good items. The solution to this problem is not straightforward when the expected number of rejects from the process is a random variable and when there are alternative penalties associated with producing too many or too few items. This paper discusses various aspects of this problem as well as some of the proposed solutions to it. In addition, tables of optimum reject allowances based on a comprehensive model are presented. 相似文献
Exporting Democracy: Fulfilling America's Destiny. By Joshua Muravchik, American Enterprise Institute (1991) ISSN 0–8447–3734–8. $12.95.
Generals in the Palacio. By Roderick Ai Camp. Oxford University Press, (1992), ISBN 0–19–507300–2, £45.
L'Armement en France. Genèse, Ampleur et Coût d'une Industrie By François Chesnais and Claude Serfati, Editions Nathan, Collection Economie/Sciences Sociales, Paris (1992), ISBN 2–09–190086–9.
The Têt Offensive. Intelligence Failure in War. By James Wirtz, Cornell University Press, New York (1991), ISBN 0–8014–2486–0. $38.50.
Restructuring of arms producton in Western Europe. Edited by Michael Brzoska and Peter Lock. Oxford University Press, Oxford (1992), ISBN 0–1982–9147–7. £25.00.
What is Proper Soldiering? A study of new perspectives for the future uses of the Armed Forces of the 1990s. By Michael Harbottle. The Centre for International Peacebuilding, Chipping Norton (1992), £3.50.
The Strategic Defence Initiative By Edward Reiss, Cambridge University Press, Cambridge (1992), ISBN 0–521–41097–5. £30.00. 相似文献
Strategic Air Defense. Edited by Stephen J. Cimbala. Scholarly Resources, Wilmington, DE (1989), ISBN 0–8420–2285–6, $40.00
NATO's Defence of the North. Brassey's Atlantic Commentaries No. 1. Edited by Eric Grove. Brassey's, London (1989), ISBN 0–08–037339–9, £7.50
Maritime Strategy and the Balance of Power: Britain and America in the Twentieth Century. Edited by John B. Hattendorf and Robert S. Jordan. Macmillan, London (1989), ISBN 0–333–43789–6, £45.00
Superpowers at Sea: an Assessment of the Naval Arms Race. By Richard Fieldhouse and Shunji Taoka. SIPRI, Oxford (1989), ISBN 0–19–829135–3
Security at Sea: Naval Arms Control. Edited by Richard Fieldhouse. Oxford University Press, Oxford (1990), ISBN 0–19–829130–2, £25.00
Strategy in the Southern Oceans: a South American View. By Virginia Gamba‐Stonehouse. Pinter, London (1989), ISBN 0–86187–017–4, £30.00
The Defence Industrial Base and the West. Edited by D. G. Haglund. Routledge, London (1989), ISBN 0–415–00923–5, £30.00
Defense and Détente: US and West German Perspectives on Defense Policy. Edited by Joseph I. Coffey and Klaus von Schubert. Westview Press, Boulder, CO, ISBN 0–8133–7722–6, $36.50 相似文献
A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rn | a < Ax < b, a, b ε Rm} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program. 相似文献
In this paper we present a new formulation of the quadratic assignment problem. This is done by transforming the quadratic objective function into a linear objective function by introducing a number of new variables and constraints. The resulting problem is a 0-1 linear integer program with a highly specialized structure. This permits the use of the partitioning scheme of Benders where only the original variables need be considered. The algorithm described thus iterates between two problems. The master problem is a pure 0-1 integer program, and the subproblem is a transportation problem whose optimal solution is shown to be readily available from the master problem in closed form. Computational experience on problems available in the literature is provided. 相似文献
A cutting plane scheme embedded in an implicit enumeration framework is proposed for ranking the extreme points of linear assignment problems. This method is capable of ranking any desired number of extreme points at each possible objective function value. The technique overcomes storage difficulties by being able to perform the ranking at any particular objective function value independently of other objective values. Computational experience on some test problems is provided. 相似文献
This article provides formulas for estimating the parameters to be used in the basic EOQ lot-size model. The analysis assumes that the true values of these parameters are unknown over known ranges and perhaps nonstationary over time. Two measures of estimator “goodness” are derived from EOQ sensitivity analysis. Formulas are given for computing the minimax choice and the minimum expected value choice for the parameter estimates using both measures of estimator “goodness”. A numerical example is included. 相似文献