A Probabilistic Formulation of Problem of Optimal Search for a Lost Person

This paper deals with a simple probabilistic description of some issues related to searching for a missing person. The questions solved are only a small part of a complex area of the search and rescue problems, but they nevertheless concern at least two interesting points of the application of mathematics in managerial decision-making. First, we propose the use of Bayes’ rule to recalculate the probability of a lost person’s location based on additional information. Next, the optimal ordering of searched areas is determined that minimizes the average (expected) search time. Finally, the proposed solutions will be illustrated with several artificial examples.