A simple Markov model for the analysis of multiple air combat

It is proposed to describe multiple air-to-air combat having a moderate number of participants with the aid of a stochastic process based on end-game duels. A simple model describing the dominant features of air combat leads to a continuous time discrete-state Markov process. Solution of the forward Kolmogorov equations enables one to investigate the influence of initial force levels and performance parameters on the outcome probabilities of the multiple engagement. As is illustrated, such results may be useful in the decision-making process for aircraft and weapon system development planning. Some comparisons are made with Lanchester models as well as with a semi-Markov model.     

Quadratic as parametric linear programming

This paper describes an approximate solution procedure for quadratic programming problems using parametric linear programming. Limited computational experience suggests that the approximation can be expected to be “good”.     

An informal survey of multi-echelon inventory theory

Contained herein is an informal nonmathematical survey of research in multi-echelon inventory theory covering published results through 1971. An introductory section defines the term, “multi-echelon,” and establishes the kinds of problems involving multi-echelon considerations. Subsequent sections provide surveys of research on deterministic and stochastic multi-echelon inventory control problems, allocation models, and multi-echelon planning and evaluation models. A final section discusses the present state of the art and suggests directions for future research. A bibliography of papers concerning multi-echelon inventory theory and applications is included.     

Stock control in a many depot system

The chief problems considered are: (1) In a parallel set of warehouses, how should stocks be allocated? (2) In a system consisting of a central warehouse and several subsidiary warehouses, how much stock should be carried in each? The demands may have known, or unknown, distribution functions. For problem (1), the i-th stock n_i should usually be allocated in proportion to the i-th demand m_i; in special cases, a significant improvement is embodied in the formula (N = total allocable stock)

     

Suboptimal algorithms for the quadratic assignment problem

The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors.     

Impact of an all volunteer force upon the navy in the 1972-1973 timeframe

This paper develops estimates of true volunteer levels for 1972 and 1973, based on experience gained through 1970 draft lottery data. The paper also formulates estimates of the qualitative characteristics of a 1972-1973 Navy volunteer force, and establishes a relationship between rate of volunteerism and military pay. Utilizing estimates generated in the paper, Navy military personnel budget requirements for FY '72 and '73 are presented.     

An application of linear programming to contingency planning: A tactical airlift system analysis

A linear programming application for the selection of aircraft for a tactical airlift fleet is described.