Linear programming which shows the best investment strategy for the client is Max Z=0.12I +0.09B and subject to constraints are :I+ B<=25000,
0.005 I +0.004B<=250.
Given maximum investment client can make is $55000, annual return= 9%, The investment advisor requires that at most $25,000 of the client's funds should be invested in the internet fund. The internet fund, which is the more risky of the two investment alternatives, has a risk rating of 5 per thousand dollars invested. the blue chip fund has a risk rating of 4 per thousand dollars invested.
We have to make a linear programming problem.
Let
I= Internet fund investment in thousands.
B=Blue chip fund investment in thousands.
Objective function:
Max Z=0.12I+0.09B
subject to following constraints:
Investment amount: I+ B<=25000
Risk Rating: 5/100* I+4/100*B<=250 or 0.005 I +0.004B<=250
I,B>=0.
Hence the objective function is Max Z=0.12 I+ 0.09 B.
Learn more about LPP at brainly.com/question/25828237
#SPJ4
Answer:
x > -11
Step-by-step explanation:
<u>Step 1: Subtract 6 from both sides</u>
-4x + 6 - 6 < 50 - 6
-4x < 44
<u>Step 2: Divide both sides by -4</u>
-4x / -4 < 44 / -4
If you divide by a negative number, you flip the sign.
<em>x > -11</em>
Answer: x > -11
Answer:
s = 22.5 m
Step-by-step explanation:
the equation for the speed change of a coach moving along a straight section of the road and starting braking at a speed of 20 m / s has the form v (t) = 25-5t. Using integral calculus, determine the coach's braking distance.
v (t) = 25 - 5 t
at t = 0 , v = 20 m/s
Let the distance is s.
Let at t = t, the v = 20
So,
20 = 25 - 5 t
t = 1 s
So, s = 25 x 1 - 2.5 x 1 = 22.5 m
Answer:
The triangle does not exist because sin(A)/a can not be equal to sin(B)/b
Step-by-step explanation:
we know that
step 1
Find the measure of angle B
Applying the law of sines
we have
substitute
Remember that the value of sine can not be greater than 1
therefore
The triangle does not exist because sin(A)/a can not be equal to sin(B)/b
Answer:
A
Step-by-step explanation:
In a matrix we go by row, then column so 2 rows and 3 columns
