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

Zeev Zeitlin
Additional contact information
Zeev Zeitlin: Delft University of Technology, Netherlands

Operations Research, 1981, vol. 29, issue 1, 207-211

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.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.1.207 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:29:y:1981:i:1:p:207-211

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().