An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
The paper presents an algorithm for solving the Lagrangean dual of the nonlinear knapsack problem with additional nested constraints. Consequently, it produces a feasible solution, and lower and upper bounds on the optimal objective value of the primal problem. Numerical results are reported.
scientific article; zbMATH DE number 991016