The Loading Problem

S. N. Narahari Pandit
Additional contact information
S. N. Narahari Pandit: Indian Institute of Technology, Kharagpur, India

Operations Research, 1962, vol. 10, issue 5, 639-646

Abstract: Two techniques, of lexicographic search and of bracketing bounds, are developed in the context of the loading or knapsack problem. Starting from an initial feasible selection, the first technique proceeds to an “intelligent enumeration” of all the exchanges possible and leads to a better selection, when one exists. The second technique sets upper bounds to feasible values (of the objective function) and allows us to take decisions about the selection of articles by employing a criterion involving conditional bounds. The techniques are easy to apply and allow of direct extension to the case of multiple criteria.

Date: 1962
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.5.639 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:10:y:1962:i:5:p:639-646

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().