On a nonseparable convex maximization problem with continuous knapsack constraints

We develop a polynomial-time algorithm for a class of nonseparable convex maximization problems with continuous knapsack constraints based on an analysis of the Karush–Kuhn–Tucker optimality conditions and the special problem structure. This problem class has applicability in areas such as production and logistics planning and financial engineering.