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
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

#questionA 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 grad

The Operations Function has always relied heavily on information for its smooth running. During this course information has been introduced as one of the five inputs to the convers

Among other limitations of O. R the followings deserve mention: a. Basis: The operational researchers must be unbiased. An attempt to shoehorn result sin to a confirmation of ma

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

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

history of modi

Software House named as Harvester, got to increase the speed of service and I need to get 3000 words written

Method of Concurrent Deviations The  coefficient  of concurrent  deviation or coefficient  of correlation  b the concurrent deviation  methods  is given  by the formula. R

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