| Article ID: | iaor19942416 |
| Country: | South Korea |
| Volume: | 19 |
| Issue: | 1 |
| Start Page Number: | 201 |
| End Page Number: | 206 |
| Publication Date: | Apr 1994 |
| Journal: | Journal of the Korean ORMS Society |
| Authors: | Benkherouf L., Balki Z.T. |
| Keywords: | search |
The linear search problem is concerned with finding a hidden target on the real line R. The position of the target is governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Processes (MDP) theory. It is the aim of the paper to give an MDP formulation to the search problem which the authors feel is both natural and easy to follow. [In Korean.]