Find the maximum expected holdings, Mathematics

Assignment Help:

Problem:

A person has 3 units of money available for investment in a business opportunity that matures in 1 year. The opportunity is risky in that the return is either double or nothing. Based on past performance, the likelihood of doubling one's money is 0.6, while the chance of losing an investment is 0.4. Money earned one year can be reinvested in a later year and investments are restricted to unit amounts.

When dynamic programming is used to find the investment strategy for the next 4 years that will maximize the expected total holdings at the end of that period, the problem is formulated as a four-stage process with each stage representing a year. The states sj are the amounts of money available for investment for stage j (j = 1; 2; 3; 4).

Let fj(sj) denote the maximum expected holdings at the end of the process, starting in state sj at stage j.

(a) By clearly explaining your reasoning show that a recursive formula for finding the maximum expected holdings at the end of four years is given by

2018_Find the maximum expected holdings at the end of the four years.png

for j = 1; 2; 3 and 4, where the values of α and β are to be determined.

(b) Write down an expression for f5(s).

(c) Find the maximum expected holdings at the end of the four years.


Related Discussions:- Find the maximum expected holdings

Transpose of a matrix, I didn't understand the concept of Transpose of a Ma...

I didn't understand the concept of Transpose of a Matrix, need assistance.

Formulas, how many formulas there for the (a-b)2

how many formulas there for the (a-b)2

Evaluate distance traveled by train, Evaluate distance traveled by train: ...

Evaluate distance traveled by train: A plane flying at 525 miles per hour completes a trip in 2 hours less than another plane flying at 350 miles per hour.  What is the distan

Homework, How do you simplify 10:30:45

How do you simplify 10:30:45

Relationship between the shortest path distances - tree, 1. a)  Given a dig...

1. a)  Given a digraph G = (V,E), prove that if we add a constant k to the length of every arc coming out from the root node r, the shortest path tree remains the same.  Do this by

Example of intersection, Can anybody provide me the solution of the followi...

Can anybody provide me the solution of the following example? You are specified the universal set as T = {1, 2, 3, 4, 5, 6, 7, 8} And the given subjects of the universal s

Assignment Help, I would like to work on Assignment help in Mathematics

I would like to work on Assignment help in Mathematics

Prerequisite, Is prerequisite multipcation or addition

Is prerequisite multipcation or addition

Examining a related problem, how to explain this strategy? how to do this s...

how to explain this strategy? how to do this strategy in solving a problem? can you give some example on how to solve this kind of strategy.

Algebra, Manuel is a cross-country runner for his school’s team. He jogged ...

Manuel is a cross-country runner for his school’s team. He jogged along the perimeter of a rectangular field at his school. The track is a rectangle that has a length that is 3 tim

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd