Bayesian estimation and optimal designs in partially accelerated life testing

A method of life testing is proposed which combines both ordinary and accelerated life-testing procedures. It is assumed that an item can be tested either in a standard environment or under stress. The amount of stress is fixed in advance and is the same for all items to be tested However, the time x at which an item on lest is taken out of the standard environment and put under stress can be chosen by the experimenter subject to a given cost structure. When an item is put under stress its lifetime is changed by the factor α. Let the random variable T denote the lifetime of an item in the standard environment, and let γ denote its lifetime under the partially accelerated test procedure just described. Then Y = T if T ≦ x, and Y = x + α (T > x) if T > x. It is assumed that T has an exponential distribution with parameter θ. The estimation of θ and α and the optimal design of a partially accelerated life test are studied in the framework of Bayesian decision theory.     

Some bayes tests and their asymptotic properties for the multivariate,multisample goodness-of-fit problem

Independent samples are taken from C multivariate populations with continuous but unknown cumulative distribution function c.d.f.). The problem is to test the hypothesis that the C population c.d.f's are identical to a specified c.d.f. We approach this problem by first transforming the data so that the hypothesis being tested is that the common distribution is uniform over a unit hypercube. We then construct some Bayes tests and investigate their asymptotic properties. These tests are based on the asymptotic normality of the number of observations falling in the “asymptotically sufficient groupings”.     

A recursive algorithm for a summed multinomial density function

An algorithm for calculating the probabilities of a summed multinomial density function which is recursive with n (the number of trials) is presented. Having application in inspector error models for auditing and quality control problems with Cartesian product structures, the algorithm is discussed in the context of computing optimal economic sampling plans. Computational experience with the algorithm is presented.     

On single-machine sequencing with order constraints

A collection of jobs is to be processed by a single machine. Each job has a cost function associated with it which may be either linear or exponential, costs accruing when a job is completed. The machine may be allocated to the jobs according to a precedence relation. The problem is to find a strategy for allocating the machine which minimizes the total cost and which is consistent with the precedence relation. The paper extends and simplifies some previous work done by Sidney.     

An inventory problem with obsolescence

A stochastic single product convex cost inventory problem is considered in which there is a probability, π_j, that the product will become obsolete in the future period j. In an interesting paper, Barankin and Denny essentially formulate the model, but do not describe some of its interesting and relevant ramifications. This paper is written not only to bring out some of these ramifications, but also to describe some computational results using this model. The computational results show that if obsolescence is a distinct possibility in the near future, it is quite important that the probabilities of obsolescence be incorporated into the model before computing the optimal policies.     

A finite algorithm for concave minimization over a polyhedron

We present a new algorithm for solving the problem of minimizing a nonseparable concave function over a polyhedron. The algorithm is of the branch-and-bound type. It finds a globally optimal extreme point solution for this problem in a finite number of steps. One of the major advantages of the algorithm is that the linear programming subproblems solved during the branch-and-bound search each have the same feasible region. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some preliminary computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several bilinear programming problems with the code.     

Decision costs in the intelligence cycle

John Terraine, The Smoke and the Fire: Myths and Anti‐Myths of War 1861–1945. London: Sidgwick &; Jackson, 1980. Pp. 240; £8.95.

Stephen Roskill, Admiral of the Fleet: Earl Beatty. London: Collins,1980. Pp. 430; £12.95.

Peter and Leni Gillman, ’Collar the Lot’. How Britain Interned and Expelled its Wartime Refugees. London: Quartet Books, 1980. Pp. 314; £8.95.

Frederic A. Bergerson, The Army Gels An Air Force: Tactics of Insurgent Bureaucratic Politics. Baltimore and London: The Johns Hopkins University Press, 1980. Pp. xiii + 216; £8.50.

Christoph Bertram (ed), Prospects of Soviet Power in the 1980s. London: Macmillan, and IISS, 1980. Pp. 126; £15.

James M. Roherty (ed.), Defense Policy Formulation: Towards Comparative Analysis. Durham, NC: Carolina Academic Press, 1980. Pp. 315; $14.95.

Franklyn Griffiths and John C. Dolanyi, The Dangers of Nuclear War. Toronto: University of Toronto Press, 1979. $15.00.

Kenneth Mackenzie, Turkey under the Generals. London: Institute for the Study of Conflict, Conflict Studies. Number 126, January 1981. Pp. 31.