Skip to main content
SpringerLink
Log in

Optimal strategies for a class of adaptive search processes

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Optimal strategies are investigated for a class of one-dimensional search processes in which the objective is to find a point which is near, but not beyond, a boundary of uncertain location. Problems of this type are encountered in the analysis of mining operations. Upper and lower bounds for the optimal expected payoff are derived, and the optimal search strategies are described explicitly for a large subclass of these processes. Results are obtained by formulating the search as a multistage decision process and using a dynamic programming approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Derman, C., andIgnall, E.,On Getting Close to but not Beyond a Boundary, Journal of Mathematical Analysis and Applications, Vol. 28, pp. 128–143, 1969.

    Article  MathSciNet  MATH  Google Scholar 

  2. Stratonovich, R. L.,On Optimal Control Theory: Sufficient Coordinates, Automation and Remote Control, Vol. 23, pp. 847–854, 1962.

    MathSciNet  Google Scholar 

  3. Bellman, R.,Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.

    MATH  Google Scholar 

  4. Willman, W. W.,More on a Class of Optimal Search Problems, Naval Research Laboratory, Report No. NRL-7487, 1972.

Download references

Author information

Authors and Affiliations

  1. Operations Research Branch, Naval, Research Laboratory, Washington, DC

    W. W. Willman (Operations Research Analyst)

Authors
  1. W. W. Willman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by S. E. Dreyfus

Rights and permissions

Reprints and permissions

About this article

Cite this article

Willman, W.W. Optimal strategies for a class of adaptive search processes. J Optim Theory Appl 12, 497–511 (1973). https://doi.org/10.1007/BF00935244

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00935244

Keywords

Search

Navigation