On a nonseparable convex maximization problem with continuous knapsack constraints Academic Article uri icon


  • 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. 2006 Elsevier B.V. All rights reserved.

published proceedings


author list (cited authors)

  • Romeijn, H. E., Geunes, J., & Taaffe, K.

citation count

  • 13

complete list of authors

  • Romeijn, H Edwin||Geunes, Joseph||Taaffe, Kevin

publication date

  • March 2007