✦ LIBER ✦

An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints

✍ Scribed by W.O. Riha; J. Walker

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 471 KB
Volume: 78
Category: Article
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(96)00101-x

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents an efficient algorithm for solving the Lagrangean dual of nonlinear knapsack problems with additional nested constraints. The dual solution provides a feasible primal solution (if it exists) and associated lower and upper bounds on the optimal objective function value of the primal problem. Computational experience is cited indicating computation time, number of dual iterations, and "tightness" of the bounds.