Don't understand number 1
1 answer:
You might be interested in
Answer:
See the proof below.
Step-by-step explanation:
What we need to proof is this: "Assuming X a vector space over a scalar field C. Let X= {x1,x2,....,xn} a set of vectors in X, where . If the set X is linearly dependent if and only if at least one of the vectors in X can be written as a linear combination of the other vectors"
Proof
Since we have a if and only if w need to proof the statement on the two possible ways.
If X is linearly dependent, then a vector is a linear combination
We suppose the set is linearly dependent, so then by definition we have scalars
in C such that:
And not all the scalars are equal to 0.
Since at least one constant is non zero we can assume for example that , and we have this:
We can divide by c1 since we assume that and we have this:
And as we can see the vector can be written a a linear combination of the remaining vectors
. We select v1 but we can select any vector and we get the same result.
If a vector is a linear combination, then X is linearly dependent
We assume on this case that X is a linear combination of the remaining vectors, as on the last part we can assume that we select and we have this:
For scalars defined in C. So then we have this:
So then we can conclude that the set X is linearly dependent.
And that complet the proof for this case.
Answer:
(c, m) = (45, 10)
Step-by-step explanation:
A dozen White Chocolate Blizzards generate more income and take less flour than a dozen Mint Breezes, so production of those should clearly be maximized. Making 45 dozen Blizzards does not use all the flour, so the remaining flour can be used to make Breezes.
Maximum Blizzards that can be made: 45 dz. Flour used: 45×5 oz = 225 oz.
The remaining flour is ...
315 oz -225 oz = 90 oz
This is enough for (90 oz)/(9 oz/dz) = 10 dozen Mint Breezes. This is in the required range of 2 to 15 dozen.
Kelly should make 45 dozen White Chocolate Blizzards and 10 dozen Mint Breezes: (c, m) = (45, 10).
__
In the attached graph, we have reversed the applicable inequalities so the feasible region shows up white, instead of shaded with 5 different colors. The objective function is the green line, shown at the point that maximizes income. (c, m) ⇔ (x, y)
