THE THEORY OF SEARCH: OPTIMUM DISTRIBUTION OF SEARCH EFFORT.

The article discusses the theory of search. The author attempts to formulate the optimum allocation of search effort as a convex programming problem. By doing so, the author believes the solutions to the problems could be made to be treated by the adjacent extreme point methods of linear programming. According to the author, the class of cases that involves discrete (statistical) distributions is among the easiest to apply search theory to. Also discussed are ways of applying the theory to continuous distributions.