Determine phases-states-decisions and probability , Operation Research

G. Ambler has € 10000 available for a second hand car, but would like to buy a fast car that costs € 25000. He needs the money for that car quickly, and would like to increase his capital to € 25000 via a gambling game. To this end, he can play a game in which he is allowed to toss an imperfect (with probability 0.4 for heads) coin three times. For each toss he may bet each amount (in multiples of € 1000 and the amount should be in his possession). He will win the amount (i.e. receives twice the amount of the bet) when he tosses head, and loses his betted amount when he tosses tails. Use stochastic dynamic programming to determine a strategy that maximises the probability of reaching € 25000 after three tosses.

(a) Determine the phases n, states i, decisions d, en optimal valuefunction fn(i) for this stochastic dynamic programming problem.
(b) Give the recurrence relations for the optimal value function.
(c) Determine the optimal policy, and describe in words what this policy does. What is the expected probability of succes?

 

Posted Date: 3/5/2013 8:09:19 AM | Location : United States







Related Discussions:- Determine phases-states-decisions and probability , Assignment Help, Ask Question on Determine phases-states-decisions and probability , Get Answer, Expert's Help, Determine phases-states-decisions and probability Discussions

Write discussion on Determine phases-states-decisions and probability
Your posts are moderated
Related Questions
we have three reservoirs with daily supplies of15, 20 and 25 litres of fresh water respectively. on each day we must supply four cities A B C D whose demands are 8 10 12 and 15 res

history of modi

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0


ABC Company manufactures both interior and exterior paints from 2 raw materials M1 and M2. The following table gives basic data of problem.     Exterior

Photographs and Illustrations: Photographs and illustrations are documents which provide a visual or pictorial representation of a person, place or situation which words fail