Answer:
G (1,7)
H (2,7)
F (1,-1)
E (2,-1)
Step-by-step explanation:
Answer:
I think B and C
Step-by-step explanation:
Because they are the only ones that have more than two so you know it would be them
Answer:
The maximum profit is when they make 10 units of A and 2 units of B.
Step-by-step explanation:
Let x is units of milk
Let y units of cacao
Given that :
The company's production plant has a total of 22 units of milk and 46 units of cacao available.
2x + y ≤ 22 (2 unit of milk for each of A and 1 for B; 22 units available)
4x + 3y ≤46 (4 unit of milk for each of A and 3 for B; 46 units available
Graph the constraint equations and find the point of intersection to determine the feasibility region.
The intersection point (algebraically, or from the graph) is (10, 2)
The objective function for the problem is the total profit, which is $6.2 per unit for A and $4.2 per unit for B: 6.2x + 4.2y.
Hence, we substitute (10, 2) into the above function:
6.2*10 + 4.2*2 = 70.4
The maximum profit is when they make 10 units of A and 2 units of B.
Answer:
Classifications would include
Rational; Fraction; Can be turned into Decimal; Positive
Those would be classifications
Answer:
665,640 minutes
Step-by-step explanation:
The number of minutes in a day = 24 * 60 = 1440
To travel one full ration takes 462.25 * 1440
= 665,640 minutes