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

Optimum Distribution of Effort: An Extension of the Koopman Basic Theory

Author

Listed:
  • Jacques de Guenin

    (Groupe de Recherche Opérationnelle, Esso Standard, Paris, France)

Abstract

The fundamental problem of search theory is to allocate a given amount of search effort in such a way as to maximize the over-all probability of discovering an object located in a given space. The problem has already been solved under the assumption that the probability of detecting the object is a negative exponential function of the search effort density, this assumption seems to be fairly realistic in many military applications, but has definite drawbacks in others. In this paper a method is provided for solving the problem in the general case, where no assumption is made concerning the form of the detection probability function. A theorem is derived that gives a general relation governing the optimal solution.

Suggested Citation

  • Jacques de Guenin, 1961. "Optimum Distribution of Effort: An Extension of the Koopman Basic Theory," Operations Research, INFORMS, vol. 9(1), pages 1-7, February.
    • Handle: RePEc:inm:oropre:v:9:y:1961:i:1:p:1-7
    DOI: 10.1287/opre.9.1.1
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.9.1.1
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.9.1.1?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. Delavernhe, Florian & Jaillet, Patrick & Rossi, André & Sevaux, Marc, 2021. "Planning a multi-sensors search for a moving target considering traveling costs," European Journal of Operational Research, Elsevier, vol. 292(2), pages 469-482.
    2. Frédéric Dambreville & Jean‐Pierre Le Cadre, 2002. "Detection of a Markovian target with optimization of the search efforts under generalized linear constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(2), pages 117-142, March.
    3. 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.
    4. Frédéric Dambreville & Jean‐Pierre Le Cadre, 2007. "Constrained minimax optimization of continuous search efforts for the detection of a stationary target," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 589-601, September.

    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:9:y:1961:i:1:p:1-7. 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.