A note on a general non-linear knapsack problem

This paper discusses a general non-linear knapsack problem with a concave objective function and a single conves constraint. in particular, it includes an efficient procedure to find the continuous (relaxed) solution and a reduction process which computes tight lower and upper bounds on the integer...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters 1986, Vol.5 (2), p.79-81
Main Authors: Mathur, Kamlesh, Salkin, Harvey M., Mohanty, Bidhu B.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
integer programming
Mathematical programming
non-linear knapsack problem
Operational research and scientific management
Operational research. Management science
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper discusses a general non-linear knapsack problem with a concave objective function and a single conves constraint. in particular, it includes an efficient procedure to find the continuous (relaxed) solution and a reduction process which computes tight lower and upper bounds on the integer variables. Some implicit enumeration criteria to be used in an enumeration algorithm are also suggested.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(86)90107-0