Answer:
- 40 packages from Fred Motors
- 20 packages from Admiral Motors
- 40 packages from Chrysalis
Step-by-step explanation:
I would formulate the problem like this. Let f, a, c represent the numbers of packages bought from Fred Motors, Admiral Motors, and Chrysalis, respectively. Then the function to minimize (in thousands) is …
objective = 500f +400a +300c
The constraints on the numbers of cars purchased are …
5f +5a +10c >= 700
5f +10a +5c >= 600
10f +5a +5c >= 700
Along with the usual f >=0, a>=0, c>=0. Of course, we want all these variables to be integers.
Any number of solvers are available in the Internet for systems like this. Shown in the attachments are the input and output of one of them.
The optimal purchase appears to be …
- 40 packages from Fred Motors
- 20 packages from Admiral Motors
- 40 packages from Chrysalis
The total cost of these is $40 million.
Answer:
12,789
Step-by-step explanation:
Matrix B has dimensions 4x3
Matrix C has dimensions 3x4
Write out those dimensions like so: 4x3 3x4
The inner '3's match up so B*C is possible. The dimensions of B*C is 4x4 as these are the outer dimensions when lining up 4x3 3x4
Since B*C is a square matrix, it is possible that an inverse could exist. Keep in mind that this isn't a guarantee as the determinant of B*C could be zero (which would lead to BC being non-invertible). Though of course we'd need more info.
Answer:
y=8x
since it goes up by 8 each time and theirs nothing added since its intercept is 0
Hope This Helps!!!