THE KNAPSACK PROBLEM REVISIStED - A SIMPLE AND EFFECTIVE TOOL FOR INDUSiRIAL DECISION-MAKING AT ALL LEVELS

Keith Sandrock

Abstract


ENGLISH ABSTRACT: The knapsack problem is a classical optimization problem in which an optimum set of items is chosen according to some or other attribute, and subject to a limiting constraint(bottleneckl. The problem is often solved using integer linear programming software. However if the number of items is not large, it c~ be solved very simply, and very efficiently using graphical methods. The problem is a common one in industry, occuring at all levels in the organization. The graphical technique for the knapsack problem is excellent for examining these problems and is a tool which could be used more often with good results.

AFRIKAANSE OPSOMMING: Die bekende ..Knapsack Problem" is' n oorspronklike line~re programmerings model vir die keuse van 'n optimaal versameling items uit 'n groter bevolking, op grond van een of ander eienskap, en onderhewig aan sekere beperkings. Die' probleem word gewoonlik deur gebruik van rekenaar programmatuur opgelos, maar indien die aantal items klein genoeg is om hanteerbaar te wees, is dit makliker om grafiese metodes te gebruik. Vir die oplossing van probleme van ..Knapsack" aard, wat dikwels in die bedryfsomgewing voorkom, is grafiese metodes van ui ters belang, en behoort meer aandag te geniet.


Full Text:

PDF


DOI: https://doi.org/10.7166/4-2-428

Refbacks

  • There are currently no refbacks.




Copyright (c) 2015 The South African Journal of Industrial Engineering


ISSN 2224-7890 (on-line) ; ISSN 1012-277X (print)


Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


Disclaimer:

This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help