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

Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions

Author

Listed:
  • Zeev Zeitlin

    (Delft University of Technology, Netherlands)

Abstract

The paper treats the problem of integer resource allocations using the min-max criterion. The objective function is assumed to be strictly quasiconvex (in the integer sense) and separable. The optimality conditions are used to obtain a solution algorithm which may be simplified in the case of strict monotonicity.

Suggested Citation

  • Zeev Zeitlin, 1981. "Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions," Operations Research, INFORMS, vol. 29(1), pages 207-211, February.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:1:p:207-211
    DOI: 10.1287/opre.29.1.207
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.1.207
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.1.207?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. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.

    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:29:y:1981:i:1:p:207-211. 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.