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

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.