Mathematics Homework Solutions
Problem
#7912

Operations Research : Investment Problem

Al has $60,000 that he wants to invest now in order to use the accumulation for purchasing a retirement annuity in 5 years. After consulting with his financial adviser, he has been offered four types of fixed-income investments, which we will label as investments A,B,C, D.
Investments A and B are available at the beginning of each of the next 5 years (call them years 1 to 5). Each dollar invested in A at the beginning of a year returns $1.40 (a profit of $.40) 2 years later (in time for immediate reinvestment). Each dollar invested in B at the beginning of a year returns $1.70 three years later.
Investments C and D will each be available at one time in the future. Each dollar invested in C at the beginning of year 2 returns $1.90 at the end of year 5. Each dollar invested in D at the beginning of year 5 returns $1.30 at the the end of year 5.
Al wishes to know which investment plan maximizes the amount of money that can be accumulated by the beginning of year 6.

(a) All the functional constraints for this problem can be expressed as equality constraints. To do this let A t, B t, C t, and D t be the beginning of year t for each t where the investment is available and will mature by the end of year 5. Also let R t be the number of available dollars not invested at the beginning of year t (and so available for investment in a later year). Thus, the amount invested at the beginning of year t plus R t must equal the number of dollars available for investment at that time. Write such an equation in terms of the relevant variables above for the beginning of each of the  years to obtain the five functional constraints for this problem.
(b)Formulate a complete linear programming model for this problem.


Solution Summary

An investment problem is solved using linear programming.

Solution
What is this?
By OTA - Overall OTA Rating
Departed OTA
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Linear programming - Find the complete optimal solution to this linear programming problem. Min 3X + 3Y s.t. 12X + 4Y > 48 10X + 5Y > 50 4X + 8Y > 32 X , Y > 0
  • Linear programming problem - 1. Solve the linear programming problem: minimize z = x + y subject to x + 2y =< 40, 2x + y =<40, x + y =<10, x >= 0, y >=0 The corner points are: (0, 10), (0, 20), (40/3, 40/3) ...
  • Integer linear program - Is it true that one way to solve an integer linear program is to solve the unconstrained linear program?
  • Linear Programming in Business - Discuss and provide examples of the application of Linear Programming in the industry. Why is the application of LP very important in business?
  • Linear Programming - Problems 1, 5, 10 , 19 See attached Consider the following linear program....
Browse