An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
From MaRDI portal
Publication:675985
DOI10.1016/S0377-0427(96)00101-XzbMath0878.65051MaRDI QIDQ675985
Publication date: 13 March 1997
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
algorithm; numerical examples; nested constraints; feasible primal solution; Lagrangean dual; nonlinear knapsack problem
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C30: Nonlinear programming
Cites Work
- An algorithm for a separable integer programming problem with cumulatively bounded variables
- Nonlinear programming with cumulatively bounded variables
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
- Calculating surrogate constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Multiple-Choice Nested Knapsack Model
- Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem
- An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems