formulate the optimality equations, Operation Research

Assignment Help:

Each day you own 0 or 1 stocks of certain commodity. The price of the stock is a stochastic process that can be modeled as a Markov chain with transition rates as follows

 

 

day n+1

 

 

 

100

200

day n

100

0.5

0.5

 

200

0.25

0.75

At the start of a day at which you own a stock you may choose to either sell at the current price, or keep the stock. At the start of a day at which you do not own stock, you may choose to either buy one stock at the current price or do nothing. You have initial capital of 200.

Your target is to maximize the discounted value of the profit over an infinite horizon, use discountfactor 0.8 (per day).

a) Define the states and give for each state the possible decisions.

b) Formulate the optimality equations.

c) Carry out two iterations of value iteration.

d) Formulate the L.P.-model to solve this problem. Describe how you can obtain the optimal policy from the LP formulation.

e) Choose a stationary policy and investigate using the policy iteration algorithm whether or not that policy is optimal.

f) Give the number of stationary policies. Motivate your answer by using the definition of stationary policy.


Related Discussions:- formulate the optimality equations

Uses of mode - measure of central tendency, Uses of Mode The  use of t...

Uses of Mode The  use of the mode is recommended in the following  situations: a.When a quick  and approximate measures of  central tendency desired. b.When the  measure

Rehearse - report writing presentation , Rehearse Making  presentat...

Rehearse Making  presentation is not  simple. It  is extremely  important  for us  to realize the sanctity of rehearsing  to improve the quality of the presentation. Unless

Linear programming, B A paper mill produces two grades of paper viz., X and...

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 paper

Linear programing, Solve the following Linear Programming Problem using Sim...

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

Sope, sope of operations research in a detailed manner

sope of operations research in a detailed manner

Game theory, #question:explain the theory of dominance in the solution of r...

#question:explain the theory of dominance in the solution of rectangular games?

One sample runs test - hypothesis testing, ONE SAMPLE  RUNS  TEST A ...

ONE SAMPLE  RUNS  TEST A number of  methods have been  developed fro  judging the randomness of samples on the basis of  the order in which  teh observations  are taken. It is

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