You are a thief, trying to rob a jewelry store. You go in with a 6-ft3 bag which you wish to fill up with jewels and artifacts from the store. Somehow, you know the following:
computer science
Description
You are a thief, trying to rob a jewelry store. You go in with a 6-ft3 bag which you wish to fill up with
jewels and artifacts from the store. Somehow, you know the following:
The exact weight of each piece
The exact volume of each piece
The exact value of each piece
The exact resale value of each piece, i.e., the ease with which each piece can be resold
The exact time it takes to pack each piece into your bag
Obviously, you wish you maximize the total value and resale value of each piece, minimize the total
weight and packing time (for fast, easy getaway,) all while staying within the maximum volume. This is a
multiobjective optimization problem. Information about the pieces are:
