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

BIG M, Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Table of contents - report writing presentation, Table of contents ...

Table of contents The tables  of contents  is an outline  of the order  of the chapters sections and  sub  section  with their  respective  pages. If  report  includes  a n

Linear programimg, Solve the following Linear Programming Problem using Si...

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

Rephrasing the research problem, Rephrasing the Research Problem Final...

Rephrasing the Research Problem Finally as a researcher you should rephrase the research problem. Once you have followed all the four steps above, i.e., 1) You have clear

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

What is critical defect, Question 1 What is intrinsic quality? Explain key...

Question 1 What is intrinsic quality? Explain key dimensions of a quality product or service Question 2 Explain any five sources of standards Question 3 What is Critical

Inventory models - techniques of operations research, Inventory models deal...

Inventory models deal with the problem of determination of how much to order at a point in time and when to place an order. The main objective is to minimize the sum of three

Sample linear programming problems to calculate max profit, The following l...

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

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