Skip to main content
Log in

The linear search problem rides again

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

The Linear Search Problem concerns a search for a point in the real line by continuous motion starting at 0. The optimal turning points for such a search under the hypothesis that the location of the target is distributed normally about 0 have been approximated by mechanical calculation, but no proof has been given that there is only a single minimizing strategy or that the numbers calculated do indeed approximate that strategy. Plausible arguments have been made before, both by these authors and others. In this paper, the plausible arguments are supplanted by mathematical proofs.

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

Access this article

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. Anatole Beck,On the linear search problem, Isr. J. Math.2 (1964), 221–228.

    Article  MATH  MathSciNet  Google Scholar 

  2. Anatole Beck,More on the linear search problem, Isr. J. Math.3 (1965), 61–70.

    Article  MathSciNet  Google Scholar 

  3. Anatole Beck and D. J. Newman,Yet more on the linear search problem, Isr. J. Math.8 (1970), 419–429.

    Article  MATH  MathSciNet  Google Scholar 

  4. Anatole Beck and Peter Warren,The return of the linear search problem, Isr. J. Math.14 (1973), 503–512.

    Article  MathSciNet  Google Scholar 

  5. Anatole Beck and Micah Beck,Son of the linear search problem, Isr. J. Math.48 (1984), 109–122.

    MATH  MathSciNet  Google Scholar 

  6. Peter J. Rousseeuw,Optimal search paths for random variables, J. Comput. Appl. Math.9 (1983), 279–286.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The research of the senior author has been supported by the Wisconsin Alumni Research Foundation.

The research of the junior author has been supported by Hewlett Packard, Inc. under a Faculty Development Fellowship at Cornell University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beck, A., Beck, M. The linear search problem rides again. Israel J. Math. 53, 365–372 (1986). https://doi.org/10.1007/BF02786568

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation