The Theory of Search: Optimum Distribution of Search Effort

This paper will be concerned with formulating the optimum allocation of search effort as a problem in convex programming so that their solutions may be made amenable to treatment by the adjacent extreme point methods of linear programming. Attention will be concentrated on discrete (statistical) distributions because this class of cases admits of the easiest and most straight-forward treatment. A sketch will then be given of how extensions may also be effected to continuous distributions.