lp-model and markov decision problem, Operation Research

Assignment Help:

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

 


Related Discussions:- lp-model and markov decision problem

Lpp., Paper Mill Produces Two Grades Of Paper Viz x And y Because Of Raw Ma...

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 In a We

Phases of an or project, give me an example of pre-modelling, modelling and...

give me an example of pre-modelling, modelling and post modelling phases

Chi square test as a test of homogeneit, Chi Square Test as a Test of Homog...

Chi Square Test as a Test of Homogeneit The X 2 test of homogeneity is an  extension of the chi square  test of independence of attributes. It is  designed to determine  whet

HOMEWORK, A company uses 4 pounds of resource 1 to make each unit of X1 and...

A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo

Solve the following Linear Programming Problem using Simple , Solve the fol...

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

Some guidelines for bibliography entries , Some Guidelines  for Bibliograp...

Some Guidelines  for Bibliography Entries 1. Reference of a Back  by One Authors : Mention authors  name book title ( in italics hence  to be  underlined) city  publication

Linear programming, 3. A paper mill produces two grades of paper viz., X an...

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

Linear programming simplex method, How to solve linear programming problems...

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Differentiate among descriptive and inferential analysis o, Question 1 ...

Question 1 A) Differentiate among descriptive and inferential analysis of data B) Describe with examples various measures of Central Tendency Question 2 The chi-square

Periodicals and serials - classification of documents, Periodicals and Seri...

Periodicals and Serials: Periodical publications form an important part of today's information world. It is one of the oft chosen forms of research communication. There are ov

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