Research for Computational Methods

Syndicate content
June 1, 1974
This paper presents a computationally simplified pair-exchange algorithm which has proven to be comparable with the currently available quadratic assignment problem (QAP) algorithm which can be implemented on a small computer.
Read More | Download Report
June 1, 1974
The CNA 50 Nuclear Exchange Model is a war game model based on the CODE 50 Model produced by the Lambda Corporation. It permits a 3-strike exchange between 2 opponents. Each of the first 2 strikes may be either counterforce, countervalue, or a mixture of counterforce and countervalue, as desired. The third strike is always a countervalue strike. The assignment of weapons to targets in each strike is made in an inner calculation, using a Lagrange multiplier method. The calculation procedure for CNA 50 is presented as the step by step logical sequence of equations and operations that are necessary to control the data and to calculate the desired parameters. Flow charts and a listing of the associated computer program are included. See also CRC 128 & CRC 132.
Read More | Download Report
June 1, 1974
In World War II, the phrase 'operations research' has come to describe the scientific, quantitative study of operations of war. This report is a first attempt to describe some of the methods which have proved most valuable in the study of warfare, and to indicate possible fruitful lines for further development, military and nonmilitary. The first chapter outlines the scope and methods of the subject. The second chapter discusses the relevant portions of the theory of probability, which is the field of mathematics most useful for this work. The rest of the chapters discuss techniques which have been particularly useful, with illustrations picked from work done in the recent war.
Read More | Download Report
June 1, 1974
This paper provides mathematical models for the problems of maximizing the probability of successfully obtaining a target amount (either as a burglar or as a quiz show contestant) and of maximizing expected fortune.
Read More | Download Report
June 1, 1974
A computer model was developed to aid in studying naval war scenarios in which anti-shipping operations are the main consideration. Performance of the forces involved is specified by probabilities of carrying out assigned missions, such as penetrating escort screens and attacking convoyed shipping. The model calculates expected values of the losses suffered by these forces. The model programming and inputs are designed to cover a wide range of problems.
Read More | Download Report
June 1, 1974
Explains the method of calculating the confidence limits on test data used in an earlier study. See also 10 000248.
Read More | Download Report
June 1, 1974
In general, the single product inventory model in which demands in successive periods are not independent is difficult to treat. This paper defines a large class of such problems, when there is a positive lead time for delivery, which can be treated by the classical formulation with a single state variable. All results which hold for inventory models with a constant delivery lag can be shown to hold also for this model. An application is made to a system in which demands are generated by part failure and in which a portion of these failures are repaired after a given (constant or probabilistic) time.
Read More | Download Report
December 1, 1964
The ballistic dispersion of low drag bombs dropped in sticks from the A-4 aircraft is calculated from test data. The data is inadequate to permit determination of whether dispersion depends on slant range or time of fall, but an estimate can be made for delivery parameters of interest.
Read More | Download Report
December 1, 1963
A differential game is one in which, as the action progresses, both the environment and the decisions available to the players are subject to a consistent, logical law, so that the problem is amenable to mathematical analysis. Usually, the action is continuous, and solutions can actually be obtained for a wide range of problems of extended conflict between two antagonists. The applications include various models of battles, pursuit and evasion games, dogfights and other contests of maneuvering, such as football, and some aiming and evasion problems. By allowing one player to be passive, certain programs can be optimized. A chapter is devoted to collision avoidance, in which the players cooperate rather than conflict. In what are termed games of degree the players respectively seek to maximize and minimize some numerically valued payoff. In games of kind the criterion is sharp, such as whether or not capture will occur in a pursuit situation. The two types have separate but related theories. The text concludes with chapters on the case of incomplete information and the practical aspects of applications to warfare. This is not a revised version. It was assigned a .10 version because under an original numbering system which was abandoned, there were two CNA RC's numbered 1.
Read More | Download Report
August 1, 1952
Probabilities of daylight visual detection of aircraft have been determined in trials. Comparison of the results with those predicted by visual detection theory indicates that the theory adequately describes visual detection in air interception. The agreement between trial results and theory is better when the cross-sectional areas of the targets are used in computing maximum ranges of detection than it is when the assumption is made that these ranges are proportional to the cube roots of the gross aircraft weights. See also 10 000368.00.
Read More | Download Report