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 three most popular items in Cuba are denim jeans, CD players, and CDs of U. S. rock groups. The weight and profit (in U. S. dollars) of each item are as follows: Item Weight (lb.) Profit
Denim jeans 2.1 $40
CD players 3.2 48
Compact discs 0.8 16
uan 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.

z (max) = 96

x₁  = 2

x₂ = 0

x₃ = 1

Step-by-step explanation:

Fromproblem statement:

                                    weight (lb) .          Profit $

Denim jeans                    2.1                         40

CD players                       3.2                        48

Compact Discs                0.8                        16

Objective Function z is:

z = 40*x₁  + 48*x₂ + 16*x₃             to maximize

Subject to:

Weight constrain:    5 lb

2.1*x₁  +   3.2*x₂   + 0.8*x₃

x₁≥ 0   x₂  ≥ 0        x₃ ≥ 0      All integers

Using AtomZmath on-line solver and after 2 iterations

Solution:

z (max) = 96

x₁  = 2

x₂ = 0

x₃ = 1

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for