IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v21y1973i3p741-747.html
   My bibliography  Save this article

Optimal Stopping in a Discrete Search Problem

Author

Listed:
  • Milton C. Chew

    (Rensselaer Polytechnic Institute, Troy, New York)

Abstract

In a search among m locations for an object possibly hidden in one, we are given prior probabilities of location p i , searching costs c i , and overlook probabilities α i . It is known also that an “unsearchable” location contains the object with prior probability p 0 , and, in addition, a penalty cost C is charged if the search is terminated unsuccessfully. Although an optimal search strategy for the problem is known, the best stopping rule is not. Under a certain constraint on C , independent of the prior probabilities p i , the optimal stopping rule is shown to be determined by the optimal m -stage look-ahead strategy.

Suggested Citation

  • Milton C. Chew, 1973. "Optimal Stopping in a Discrete Search Problem," Operations Research, INFORMS, vol. 21(3), pages 741-747, June.
    • Handle: RePEc:inm:oropre:v:21:y:1973:i:3:p:741-747
    DOI: 10.1287/opre.21.3.741
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.21.3.741
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.21.3.741?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jake Clarkson & Kevin D. Glazebrook & Kyle Y. Lin, 2020. "Fast or Slow: Search in Discrete Locations with Two Search Modes," Operations Research, INFORMS, vol. 68(2), pages 552-571, March.
    2. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    3. Moshe Kress & Kyle Lin & Roberto Szechtman, 2008. "Optimal discrete search with imperfect specificity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 539-549, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:21:y:1973:i:3:p:741-747. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.