1.Juan Hernandez, a Cuban athlete who visits the United States and Europe frequently, is allowed to return with a limited number of consumer items not generally available in Cuba. The items, which are carried in a duffel bag, cannot exceed a weight of 5 pounds. Once Juan is in Cuba, he sells the items at highly inflated prices. The weight and profit (in U.S. dollars) of each item are as follows:

Item

Weight (lb)

Profit

Demin Jeans

2

$ 90

CD player

3

150

Compact discs

1

30

Juan wants to determine the combination of items he should pack in his duffel bag to maximize his profit. This problem is an example of a type of integer programming problem known as a "knapsack" problem. Formulate and solve the problem.