IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v4y1958i2p136-153.html
   My bibliography  Save this article

On a Class of Minimum-Cost Problems

Author

Listed:
  • William Karush

    (The Ramo-Wooldridge Corporation, Los Angeles, California)

Abstract

The following type of problem has arisen in various contexts in applications of management science: to determine a program of future levels of activity (e.g., production or employment) subject to known future requirements, which will minimize the total cost of the projected program over the entire planning interval of time. Mathematical methods have been developed for treating variants of this problem, and the purpose of this paper is to present an outline of methods appropriate to problems which share a certain common mathematical form.

Suggested Citation

  • William Karush, 1958. "On a Class of Minimum-Cost Problems," Management Science, INFORMS, vol. 4(2), pages 136-153, January.
    • Handle: RePEc:inm:ormnsc:v:4:y:1958:i:2:p:136-153
    DOI: 10.1287/mnsc.4.2.136
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.4.2.136
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.4.2.136?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. 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.

    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:ormnsc:v:4:y:1958:i:2:p:136-153. 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.