lp-model and markov decision problem, Operation Research

The supply of a certain good is inspected periodically. If an order is placed of size x>0 (integer), the ordering costs are 8+2.x. The delivery time is zero. The demand is stochastic en equals 1 or 2 with probability ½ . Demand in subsequent periods are independent. The size of an order must be such that (a) demand in a period is always satisfied, and (b) the stock at the end of a period never exceeds 2. The holding costs in a period are 2 per unit remaining at the end of a period. Target is to minimize the expected discounted costs over infinite horizon, use discount factor 0.8.

(a)   Give the optimality equations for the Markov decision problem.

(b)   Give an LP-model that allows you to determine the optimal policy.

(c)    Carry out two iterations of the value iteration algorithm

(d)   Choose an odering policy, and investigate using the policy iteration algorithm whether or not this policy is optimal. "

 

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







Related Discussions:- lp-model and markov decision problem, Assignment Help, Ask Question on lp-model and markov decision problem, Get Answer, Expert's Help, lp-model and markov decision problem Discussions

Write discussion on lp-model and markov decision problem
Your posts are moderated
Related Questions
Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

Question 1 Explain any five accessory industries Question 2 Explain the history of boots and shoes Question 3 Write short notes on following- Types of Gujarati emb

Normal 0 false false false EN-IN X-NONE X-NONE

This methods studies development from simpler forms through a long series of a small change. Each change by itself results in minor modification in the phenomenon but the

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

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

Decision making is not only the headache of management rather all of us make decisions. We daily decide about minor issues. The essential characteristics of all decisions

#questiA 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 pa

Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv