A thief breaks into a house. He searches and finds many items of value. He carries with
Question:
A thief breaks into a house. He searches and finds many items of value. He carries with him a sack that can hold 8 cubic feet of items and he can carry 100 pounds of stolen goods in his sack. He estimates that if he is in the house longer than four minutes he will get caught, he wants to leave before this happens? The following table contains information about each of the items he can acquire.
a. Formulate the problem as an integer programming problem. Specify the complete model including all decision variables and constraints.
b. Specify what items and how many of each the thief should steal.
c. What is the limiting constraint(s), the size of the sack, the weight he can carry, or the amount of time that he has.
d. What is his profit for this endeavor?