contestada

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.

Respuesta :

Answer:

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

MrRoyal

The maximized profit is the highest profit Juan can get by selling his items.

The maximized profit is $96

Let x represents the Denim jeans, y represents the CD players and z represent the compact discs.

So, we have the following parameters

Weights

[tex]x = 2.1[/tex]

[tex]y = 3.2[/tex]

[tex]z = 0.8[/tex]

The weight cannot exceed 5 pounds.

So, the constraint is

[tex]2.1x + 3.2y + 0.8z \le 5[/tex]

The profit is given as:

[tex]x = 40[/tex]

[tex]y = 48[/tex]

[tex]z = 16[/tex]

So, the objective function to maximize is

[tex]Max\ Z = 40x + 48y + 16z[/tex]

The integer programming model is then represented as:

[tex]Max\ Z = 40x + 48y + 16z[/tex]

Subject to:

[tex]2.1x + 3.2y + 0.8z \le 5[/tex]

[tex]x,y,z \ge 0[/tex]

Using a graphing calculator, the values that maximize the objective function are:

[tex]x = 2[/tex]

[tex]y = 0[/tex]

[tex]z = 1[/tex]

Substitute these values in the objective function

[tex]Max\ Z = 40x + 48y + 16z[/tex]

[tex]Z = 40 \times 2 + 48 \times 0 + 16 \times 1[/tex]

[tex]Z = 80 + 0 + 16[/tex]

[tex]Z = 96[/tex]

Hence, the maximized profit is $96

Read more about integer programming at:

https://brainly.com/question/13841397

Otras preguntas