ON THE SOLUTION OF CONCAVE KNAPSACK-PROBLEMS

We consider a version of the knapsack problem which gives rise to a separable concave minimization problem subject to bounds on the variables and one equality constraint. We characterize strict local miniimizers of concave minimization problems subject to linear constraints, and use this characterization to show that although the problem of determining a global minimizer of the concave knapsack problem is NP-hard, it is possible to determine a local minimizer of this problem with at most O(n log n) operations and 1 + [log n] evaluations of the function. If the function is quadratic this algorithm requires at most O(n log n) operations.