A product can be made in sizes huge, average and tiny which yield a net unit profit of $14, $10, and$5, respectively. Three centers manufacture these products. The centers respectively have a capacity ofturning out 550, 750, and 275 units of the product per day, no matter what sizes are involved. The manufacturing process necessitates cooling water and each unit of huge, average, and tiny sizesproduced require 22, 16, and 9 gallons of water, respectively. Center 1 has 11,000 gallons of coolingwater available per day, Center 2, 7000, and Center 3, 4000 gallons. The daily demand is of 710, 900,and 350 units of the huge, average, and tiny siz. By company policy, the fraction (scheduled production)(center's capacity) must be the same at all the centers. The company wishes to maximize its profits. Required:
Model this problem as a linear program

The model is:

z = 14* X₁₁ + 14*X₁₂ + 5*X₁₃ + 10*X₂₁ + 10*X₂₂ + 10*X₂₃ + 5*X₃₁ + 5*X₃₂ + 5*X₃₃    to maximize

Subject to:

First center               X₁₁  +  X₂₁  + X₃₁  ≤  550

Second center         X₁₂  +  X₂₂  + X₃₂  ≤ 750

Third center               X₁₃  + X₂₃  + X₃₃  ≤ 275                  

22* X₁₁  + 16* X₂₁  + 9*X₃₁     ≤   11000

22* X₁₂  + 16* X₂₂  + 9*X₃₂   ≤   2700

22*X₁₃  + 16* X₂₃  +  9*X₃₃  ≤  3400

X₁₁  +  X₁₂  + X₁₃  ≤  710

X₂₁  + X₂₂ + X₂₃  ≤  900

X₃₁ + X₃₂ + X₃₃  ≤  350

2700*(X₁₁  +  X ₂₁  + X₃₁)  -  11000*(X₁₂ + X₂₂ + X₃₂) = 0

3400*(X₁₁  +  X ₂₁  + X₃₁) - 11000*( ( X₁₃ + X₂₃ + X₃₃) = 0

Xij >= 0

Step-by-step explanation:

Let´s call Xij   product size i produced in center j

According to this, we get the following set of variable

X₁₁    product size huge produced in center 1

X₁₂    product size huge produced in center 2

X₁₃   product size huge produced in center 3

X₂₁   product size average produced in center 1

X₂₂   product size average produced in center 2

X₂₃   product size average produced in center 3

X₃₁  product size-tiny produced in center 1

X₃₂ product size-tiny produced in center 2

X₃₃ product size-tiny produced in center 3

Then Objective function is

z = 14* X₁₁ + 14*X₁₂ + 5*X₁₃ + 10*X₂₁ + 10*X₂₂ + 10*X₂₃ + 5*X₃₁ + 5*X₃₂ + 5*X₃₃

Constrains

Center capacity

1.-   First center               X₁₁  +  X₂₁  + X₃₁  ≤  550

2.-   Second center         X₁₂  +  X₂₂  + X₃₂  ≤ 750

3.- Third center               X₁₃  + X₂₃  + X₃₃  ≤ 275

Water available

1.-  22* X₁₁  + 16* X₂₁  + 9*X₃₁     ≤   11000

2.-  22* X₁₂  + 16* X₂₂  + 9*X₃₂   ≤   2700

3.-   22*X₁₃  + 16* X₂₃  +  9*X₃₃  ≤  3400

Demand constrain

Product huge

X₁₁  +  X₁₂  + X₁₃  ≤  710

Product average

X₂₁  + X₂₂ + X₂₃  ≤  900

Product tiny

X₃₁ + X₃₂ + X₃₃  ≤  350

Fraction SP/CC must be the same

First and second centers  fraction SP/CC  

(X₁₁  +  X ₂₁  + X₃₁)/ 11000   =  (X₁₂ + X₂₂ + X₃₂)/ 2700

2700*(X₁₁  +  X ₂₁  + X₃₁)  -  11000*(X₁₂ + X₂₂ + X₃₂) = 0

First and third centers  fraction SP/CC  

(X₁₁  +  X ₂₁  + X₃₁)/ 11000   = ( X₁₃ + X₂₃ + X₃₃)/ 3400

3400*(X₁₁  +  X ₂₁  + X₃₁) - 11000*( ( X₁₃ + X₂₃ + X₃₃) = 0

The model is:

z = 14* X₁₁ + 14*X₁₂ + 5*X₁₃ + 10*X₂₁ + 10*X₂₂ + 10*X₂₃ + 5*X₃₁ + 5*X₃₂ + 5*X₃₃

Subject to:

First center               X₁₁  +  X₂₁  + X₃₁  ≤  550

Second center         X₁₂  +  X₂₂  + X₃₂  ≤ 750

Third center               X₁₃  + X₂₃  + X₃₃  ≤ 275                  

22* X₁₁  + 16* X₂₁  + 9*X₃₁     ≤   11000

22* X₁₂  + 16* X₂₂  + 9*X₃₂   ≤   2700

22*X₁₃  + 16* X₂₃  +  9*X₃₃  ≤  3400

X₁₁  +  X₁₂  + X₁₃  ≤  710

X₂₁  + X₂₂ + X₂₃  ≤  900

X₃₁ + X₃₂ + X₃₃  ≤  350

2700*(X₁₁  +  X ₂₁  + X₃₁)  -  11000*(X₁₂ + X₂₂ + X₃₂) = 0

3400*(X₁₁  +  X ₂₁  + X₃₁) - 11000*( ( X₁₃ + X₂₃ + X₃₃) = 0

Xij >= 0

sample answer: you can determine whether each element of the domain is paired with exactly one element of the range. for example, if given a graph, you could use the vertical line test; if a vertical line intersects the graph more than once, then the relation that the graph represents is not a function.

the answer is b.6

step-by-step explanation: