Determine phases-states-decisions and probability , Operation Research

Assignment Help:

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?

 


Related Discussions:- Determine phases-states-decisions and probability

Applications of statistics in management, In a business, statis...

In a business, statistics is used to study the demand and market characteristics of the product or service being sold. In fact, market research

Principles of report writing, Principles of Report Writing Reports wri...

Principles of Report Writing Reports writing  may  involve the followings principles . a. Easy to Follow : The body of the  report should  be written in a self evident and

Posson distribution - probability distribution , POSSON DISTRIBUTION ...

POSSON DISTRIBUTION   In binomial  distribution the value of n was  finite. But  there are few  problems  when  cannot  be estimated. So in these  binomial  distribution

Sequensing problem, job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10...

job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10 6 12 1 3

Assignment 2012, Problem 1 (Problem 23, page 507) At a machine tool plant, ...

Problem 1 (Problem 23, page 507) At a machine tool plant, five jobs must be completed each day. The time it takes to do each job depends on the machine used to do the job. If a mac

LINEAR PROGRAMMING, b. A paper mill produces two grades of paper viz., X an...

b. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y pape

Operation research techniques, High Costs are Involved in the Use of O. R...

High Costs are Involved in the Use of O. R Techniques: O. R techniques usually prove very expensive. Services of specialized persons are invariably called for ( and along w

Modi Method, a manufacture wants to ship 8 loads of his product as shown be...

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D.

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

1, A paper mill produces two grades of paper viz., X and Y. Because of raw ...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

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