30 POINTS !! PLEASE HELP ASAP!!
2 answers:
You might be interested in
Answer:
20 masks and 100 ventilators
Step-by-step explanation:
I assume the problem ask to maximize the profit of the company.
Let's define the following variables
v: ventilator
m: mask
Restictions:
m + v ≤ 120
10 ≤ m ≤ 50
40 ≤ v ≤ 100
Profit function:
P = 10*m + 65*v
The system of restrictions can be seen in the figure attached. The five points marked are the vertices of the feasible region (the solution is one of these points). Replacing them in the profit function:
point Profit function:
(10, 100) 10*10 + 65*100 = 6600
(20, 100) 10*20 + 65*100 = 6700
(50, 70) 10*50 + 65*70 = 5050
(50, 40) 10*50 + 65*40 = 3100
(10, 40) 10*10 + 65*40 = 2700
Then, the profit maximization is obtained when 20 masks and 100 ventilators are produced.
Answer:
Remember, if B is a set, R is a relation in B and a is related with b (aRb or (a,b))
1. R is reflexive if for each element a∈B, aRa.
2. R is symmetric if satisfies that if aRb then bRa.
3. R is transitive if satisfies that if aRb and bRc then aRc.
Then, our set B is .
a) We need to find a relation R reflexive and transitive that contain the relation
Then, we need:
1. That 1R1, 2R2, 3R3, 4R4 to the relation be reflexive and,
2. Observe that
- 1R4 and 4R1, then 1 must be related with itself.
- 4R1 and 1R4, then 4 must be related with itself.
- 4R1 and 1R2, then 4 must be related with 2.
Therefore is the smallest relation containing the relation R1.
b) We need a new relation symmetric and transitive, then
- since 1R2, then 2 must be related with 1.
- since 1R4, 4 must be related with 1.
and the analysis for be transitive is the same that we did in a).
Observe that
- 1R2 and 2R1, then 1 must be related with itself.
- 4R1 and 1R4, then 4 must be related with itself.
- 2R1 and 1R4, then 2 must be related with 4.
- 4R1 and 1R2, then 4 must be related with 2.
- 2R4 and 4R2, then 2 must be related with itself
Therefore, the smallest relation containing R1 that is symmetric and transitive is
c) We need a new relation reflexive, symmetric and transitive containing R1.
For be reflexive
- 1 must be related with 1,
- 2 must be related with 2,
- 3 must be related with 3,
- 4 must be related with 4
For be symmetric
- since 1R2, 2 must be related with 1,
- since 1R4, 4 must be related with 1.
For be transitive
- Since 4R1 and 1R2, 4 must be related with 2,
- since 2R1 and 1R4, 2 must be related with 4.
Then, the smallest relation reflexive, symmetric and transitive containing R1 is