1 Linear Programming Problem
1 Linear Programming Problem
Let A represents the investment done in Fund A, B represents the investment done in Fund B, and C
represents the investment done in Fund C.
Let Z be our objective function.
(A)
Max Z=0.08A+0.10B+0.09Cs.t.A+B+C=40000B≤0.3(A+B+C)C≤0.4(A+B+C)Max Z=0.08
A+0.10B+0.09Cs.t.A+B+C=40000B≤0.3(A+B+C)C≤0.4(A+B+C)
So, the constraints will become:
A+B+C=40000−0.3A+0.7B−0.3C≤0−0.4A−0.4B+0.6C≤0A,B,C≥0A+B+C=40000−0.3A+0
.7B−0.3C≤0−0.4A−0.4B+0.6C≤0A,B,C≥0
(B)
Thus, the amount that should be allocated to Fund A, Fund B, and Fund C
is $12000,$12000,$16000$12000,$12000,$16000 respectively.
The total annual return is $3600$3600.