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

DOI10.1016/S0377-0427(96)00101-XMaRDI QIDQ675985zbMATH OpenFDO

Authors Juan-Miguel Gracia

Publication date 13 March 1997

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

numerical examplesalgorithmnested constraintsfeasible primal solutionLagrangean dualnonlinear knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Integer programming (90C10)

Recommendations

• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
• An efficient algorithm for multi-dimensional nonlinear knapsack problems
• A note on a general nonlinear knapsack problem
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Cites work

• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
• An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
• An algorithm for a separable integer programming problem with cumulatively bounded variables
• Calculating surrogate constraints
• Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
• Nonlinear programming with cumulatively bounded variables
• Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Multiple-Choice Nested Knapsack Model
• The complexity of selection and ranking in X+Y and matrices with sorted columns

Cited in

(3)

• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
• An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints
• An efficient algorithm for multi-dimensional nonlinear knapsack problems

This page was built for publication: An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675985)