IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-0303-9_14.html
   My bibliography  Save this book chapter

Resource Allocation Problems

In: Handbook of Combinatorial Optimization

Author

Listed:
  • Naoki Katoh

    (Kyoto University, Department of Architecture and Architectural Systems Graduate School of Engineering)

  • Toshihide Ibaraki

    (Kyoto University, Department of Applied Mathematics and Physics Graduate School of Informatics)

Abstract

The resource allocation problem seeks to find an optimal allocation of a fixed amount of resources to activities so as to minimize the cost incurred by the allocation. A simplest form of the problem is to minimize a separable convex function under a single constraint concerning the total amount of resources to be allocated. The amount of resources to be allocated to each activity is treated as a continuous or integer variable, depending on the cases. This can be viewed as a special case of the nonlinear programming problem or the nonlinear integer programming problem.

Suggested Citation

  • Naoki Katoh & Toshihide Ibaraki, 1998. "Resource Allocation Problems," Springer Books, in: Ding-Zhu Du & Panos M. Pardalos (ed.), Handbook of Combinatorial Optimization, pages 905-1006, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-0303-9_14
    DOI: 10.1007/978-1-4613-0303-9_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-1-4613-0303-9_14. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.