Answer:
Step-by-step explanation:
Natsano can satisfy his constraints by investing the first $20,000 in Company A, then splitting the remaining $35,000 evenly between the companies. For best return, he needs to invest as much as possible in Company B, but each such dollar (after the first 20k) must be matched by a dollar invested in Company A. That is, his investments should be ...
- Company A: $37,500
- Company B: $17,500
_____
The attached graph shows the feasible region of investments (doubly shaded). The vertex that maximizes the objective function (return on investment) is the one highlighted. (It puts the objective function line as far as possible from the origin.)
_____
Sometimes graphing the constraints is more work than necessary if there is some simple logic that quickly identifies the solution.
Okay well the mode is the number that appears most pften for ex 112351 the mode is 1 because it is the number that is there more than the others
Answer:
Hey sisters!
Step-by-step explanation:
Answer:
<h2><u>✎</u><u> </u><u>ANSWER:</u><u>-</u></h2>

Substitute the value of y as 2x - 5 in the equation.

Now, find the value of y

⎇ x = x = x, equals <u>1</u><u>0</u>
⎇ y = y = y, equals <u>15</u>
You would make at least 24 eggs ( 3 packs of eggs and 2 packs of cheese )
Hope it helps