Problem: Packing a container with objects of varying sizes to maximise efficiency, a "knapsack" problem.
This is an example of the
"Knapsack" class of problems, in which a number of things - boxes, books,
or Bradley Fighting Vehicles - must be efficiently or profitably packed in a
container (trucks, crates, or C130 aircraft). The objective can be to minimise wasted
space in the container, to maximise or minimise total load weight, or, as in this case, to
maximise the value of the load.
In the first case, we'll use What'sBest! to optimise by the conventional method. The
solution may suggest fractional answers, but we'll just round the fractions to the nearest
whole number that does not violate any constraints. In the second case, we'll find an
integer solution using the binary Integer command.
Unless specified otherwise, the entire contents of this site are protected by copyright.
(c) 1999-2010 Noel Ferguson / Remarkable Ideas Ltd. All Rights Reserved.
Postal Address: PO Box 633, Tokoroa 3444, Waikato, New Zealand
Mobile: +64-27-306-8999 After Hours: +64-7-886-0445