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

A Problem in Optimal Search and Stop

Author

Listed:
  • Sheldon M. Ross

    (University of California, Berkeley, California)

Abstract

We are told that an object is hidden in one of m ( m p i 0 that the object is in the i th box. A search of box i costs c i and finds the object with probability α, if the object is in the box. Also, we suppose that a reward R i is earned if the object is found in the i th box. A strategy is any rule for determining when to search, and, if so, which box. The major result is that an optimal strategy either searches a box with maximal value of α i p i / c i or else it never searches such boxes. Also, if rewards are equal, then an optimal strategy either searches a box with maximal α i p i / c i or else it stops.

Suggested Citation

  • Sheldon M. Ross, 1969. "A Problem in Optimal Search and Stop," Operations Research, INFORMS, vol. 17(6), pages 984-992, December.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:6:p:984-992
    DOI: 10.1287/opre.17.6.984
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.6.984
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.6.984?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. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
    2. 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.

    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:17:y:1969:i:6:p:984-992. 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.