Abstract
A major part of the paper deals with the linear search problem in which the cost function is a strictly increasing convex functionf satisfyingf(0)=0. It is shown that a number of results previously established for the casef(t)=t α can be extended to the convex case; in particular a sufficient condition for the existence of a minimizing search strategy of a simple form is obtained for the convex case. Numerous results are obtained on the existence or otherwise of terminating and non-terminating optimal search strategies for cost functions already occurring in the literature.
Similar content being viewed by others
References
A. Beck,On the linear search problem, Israel Journal of Mathematics2 (1964), 221–228.
A. Beck,More on the linear search problem, Israel Journal of Mathematics3 (1965), 61–70.
A. Beck and D. J. Newman,Yet more on the linear search problem, Israel Journal of Mathematics8 (1970), 419–429.
A. Beck and P. Warren,The return of the linear search problem, Israel Journal of Mathematics14 (1973), 503–512.
A. Beck and M. Beck,Son of the linear search problem, Israel Journal of Mathematics48 (1984), 109–122.
A. Beck and M. Beck,The linear search problem rides again, Israel Journal of Mathematics53 (1986), 365–372.
A. Beck and M. Beck,The revenge of the linear search problem, SIAM Journal on Control and Optimization30 (1992), 112–122.
D. S. Mitrinović,Analytic Inequalities, Springer-Verlag, Berlin, 1970.
A. W. Roberts and D. E. Varberg,Convex Functions, Academic Press, New York, 1973.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baston, V., Beck, A. Generalizations in the linear search problem. Israel J. Math. 90, 301–323 (1995). https://doi.org/10.1007/BF02783218
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02783218