Problem 7-25 (Algorithmic) George Johnson recently inherited a large sum of money; he wants to use a portion of this money to set up a trust fund for his two children. The trust fund has two investmen

Problem 7-25 (Algorithmic)

George Johnson recently inherited a large sum of money; he wants to use a portion of this money to set up a trust fund for his two children. The trust fund has two investment options: (1) a bond fund and (2) a stock fund. The projected returns over the life of the investments are 8% for the bond fund and 20% for the stock fund. Whatever portion of the inheritance George finally decides to commit to the trust fund, he wants to invest at least 40% of that amount in the bond fund. In addition, he wants to select a mix that will enable him to obtain a total return of at least 5.5%.

1. Formulate a linear programming model that can be used to determine the percentage that should be allocated to each of the possible investment alternatives. If required, round your answers to three decimal places.

   Let B		percentage of funds invested in the bond fund
   S		percentage of funds invested in the stock fund

2. 	fill in the blank 2 B		fill in the blank 3 S
   s.t.
   	fill in the blank 4 B				fill in the blank 6	Bond fund minimum
   	fill in the blank 7 B		fill in the blank 8 S		fill in the blank 10	Minimum return
   	fill in the blank 11 B		fill in the blank 12 S		fill in the blank 14	Percentage requirement

4. Solve the problem using the graphical solution procedure. If required, round the answers to one decimal place.
   Optimal solution: B = fill in the blank 15, S = fill in the blank 16
   Value of optimal solution is fill in the blank 17%