The search for an intelligent evader: Strategies for searcher and evader in the two-region problem

This paper considers the search for an evader concealed in one of two regions, each of which is characterized by its detection probability. The single-sided problem, in which the searcher is told the probability of the evader being located in a particular region, has been examined previously. We shall be concerned with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move: his optimal strategy consists of that probability distribution which maximizes the expected time to detection, while the searcher's optimal strategy is the sequence of searches which limits the evader to this expected time. It transpires for this problem that optimal strategies for both searcher and evader may generally be obtained to a surprisingly good degree of approximation by using the optimal strategies for the closely related (but far more easily solved) problem in which the evader is completely free to move between searches.     

CYLINDRICITY ERROR COMPENSATION IN DIAMOND TURNING VIA P－INTEGRATOR REPETITIVE CONTROL

ＣＹＬＩＮＤＲＩＣＩＴＹＥＲＲＯＲＣＯＭＰＥＮＳＡＴＩＯＮＩＮＤＩＡＭＯＮＤＴＵＲＮＩＮＧＶＩＡＰ－ＩＮＴＥＧＲＡＴＯＲＲＥＰＥＴＩＴＩＶＥＣＯＮＴＲＯＬＬｉＳｈｅｎｇｙｉ（ＤｅｐａｒｔｍｅｎｔｏｆＭｅｃｈａｎｔｒｏｎｉｃｓａｎｄＩｎｓｔｒｕｍｅｎｔ...     

An approximate solution method for the fixed charge problem

In the absence, to date, of an exact method for solving the linear programming problem with fixed charges, two heuristic methods have been proposed and extensively investigated, computationally, for moderate sized problems. The results indicate that the heuristic methods produce optimal solutions in well over 90 percent of the several hundred problems investigated and very close to optimal (a few percent) in the remaining cases. Hence it should be of practical significance to practitioners in the field.     

Programming the procurement of airlift and sealift forces: A linear programming model for analysis of the least-cost mix of strategic deployment systems

A linear programming model for analyzing the strategic deployment mix of airlift and sealift forces and prepositioning to accomplish the composite requirements of a set of possible contingencies is described in this paper. It solves for the least-cost mix of deployment means capable of meeting any one of a spectrum of contingencies, or meeting simultaneous contingencies. The model was developed by RAC as part of the U.S. Army's study program and has been used in analyses of deployment systems conducted in support of the U.S. Army, the Joint Chiefs of Staff and the Office of the Secretary of Defense. Results of analyses have influenced the preparation of long-range plans as well as the formulation of the FY67 Department of Defense budget. The paper gives the background and assumptions of the model, describes the model by means of a simple hypothetical example followed by a selected subset of a complete version, and discusses how the model is used.