An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
type: Item
instance of: scholarly article
title: An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
zbMATH Open document ID: 0878.65051
DOI: 10.1016/S0377-0427(96)00101-X
author: Juan-Miguel Gracia
published in: Journal of Computational and Applied Mathematics
publication date: 1997-03-13T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 991016
zbMATH Keywords: feasible primal solution
zbMATH Keywords: numerical examples
zbMATH Keywords: algorithm
zbMATH Keywords: Lagrangean dual
zbMATH Keywords: nonlinear knapsack problem
zbMATH Keywords: nested constraints
reviewed by: Ping-Qi Pan
MaRDI profile type: Publication
cites work: The Multiple-Choice Nested Knapsack Model
cites work: A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
cites work: An algorithm for a separable integer programming problem with cumulatively bounded variables
cites work: Calculating surrogate constraints
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem
cites work: Nonlinear programming with cumulatively bounded variables
cites work: Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
cites work: An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
description: scientific article; zbMATH DE number 991016