On a discrete nonlinear and nonseparable knapsack problem

Authors:
T. D. Klastorin
Affiliations:
Department of Management Science, 126 Mackenzie Hall, DJ-10, Schools of Business, University of Washington 98195, USA
Venue:
Operations Research Letters
Year:
1990

Citing 3
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving certain singly constrained convex optimization problems in production planning

Operations Research Letters
Review of recent development: An O( n) algorithm for quadratic knapsack problems

Operations Research Letters

On a nonseparable convex maximization problem with continuous knapsack constraints

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), we show how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems in O(n) time. This algorithm forms the basis for a branch-and-bound algorithm, which is subsequently used to test the efficacy of a proposed heuristic. Computational results are presented.