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

From MaRDI portal
Revision as of 11:46, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
scientific article

    Statements

    An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (English)
    0 references
    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

    Identifiers