E-mail this page
Our Webinars
Description
This example introduces a knapsack problem. The example considers a data set of 16 items which can be included in the knapsack. The objective is to maximize the cumulated value of the items. The number of items is restricted by the maximum weight that can be carried in the knapsack.
In the classical knapsack problem, each item can be chosen only once. This example also considers variants of the problem in which the number of equal items is unlimited or limited to certain integers.
Keywords
0-1 Knapsack, Cover Inequalities, Network Object
Model Types
(Mixed) Integer Programming, Binary Programming
Download AIMMS Example
You can download an AIMMS example dealing with this problem via the link below, and run it after installing the AIMMS software. If you don't have an AIMMS license yet, you can download a free license of AIMMS.
ftp://ftp.aimms.com/pub/Download/Examples/Knapsack Problem.aimmspack
Please make sure to save this file including the .aimmspack extension so that it can be opened by AIMMS.
This example application is a simplification of reality. Please do not hesitate to contact us to discuss how AIMMS enables you to build a complete optimization application that captures the full complexity of your problem.
Screenshot AIMMS Example
