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

The Optimum Distribution of Effort

Author

Listed:
  • Bernard O. Koopman

    (Columbia University)

Abstract

When a limited amount of effort is available for the performance of two related tasks, the practical of how it is to be divided between them in order to obtain the best over-all result is one which constantly arises in operations research. The object of the present paper is to show how the question can often be put in quantitative form, and then to give it a simple mathematical solution in illustrative cases, interpreting the results in the language of recommended procedures. Operations Research , ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.

Suggested Citation

  • Bernard O. Koopman, 1953. "The Optimum Distribution of Effort," Operations Research, INFORMS, vol. 1(2), pages 52-63, February.
    • Handle: RePEc:inm:oropre:v:1:y:1953:i:2:p:52-63
    DOI: 10.1287/opre.1.2.52
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1.2.52
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1.2.52?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. Friedrich, Ulf & Münnich, Ralf & de Vries, Sven & Wagner, Matthias, 2015. "Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling," Computational Statistics & Data Analysis, Elsevier, vol. 92(C), pages 1-12.
    2. Masih Fadaki & Babak Abbasi & Prem Chhetri, 2022. "Quantum game approach for capacity allocation decisions under strategic reasoning," Computational Management Science, Springer, vol. 19(3), pages 491-512, July.
    3. ten Eikelder, S.C.M. & van Amerongen, J.H.M., 2023. "Resource allocation problems with expensive function evaluations," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1170-1185.
    4. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    5. Xepapadeas, Petros, 2023. "Multi-agent, multi-site resource allocation under quotas with a Stackelberg leader and network externalities," Economic Modelling, Elsevier, vol. 121(C).
    6. Zeyang Wu & Kameng Nip & Qie He, 2021. "A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1197-1212, July.

    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:1:y:1953:i:2:p:52-63. 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.