Abstract
Mjelde described methods for the solution of problems of the allocation of discrete resources with binary effectiveness values of 0 or 1 against activities with concave return functions. This note extends these methods to problems with upper bounds on certain sums of allocation.