An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints |
scientific article; zbMATH DE number 991016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints |
scientific article; zbMATH DE number 991016 |
Statements
An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (English)
0 references
13 March 1997
0 references
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.
0 references
feasible primal solution
0 references
numerical examples
0 references
algorithm
0 references
Lagrangean dual
0 references
nonlinear knapsack problem
0 references
nested constraints
0 references
0 references
0 references
0.7982297539710999
0 references
0.795295000076294
0 references
0.7919334769248962
0 references
0.7910587191581726
0 references
0.7620442509651184
0 references
