Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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. "
what is meant by Application Areas of Linear Programming?
Scope of the OR techniques can be derived in followings various importance fields: 1. In Agriculture : With the explosion of population and consequent shortage of food O
main components of a linear programming
Question: (a) Discuss briefly the four basic components of any queueing system. (b) Explain what you understand by the following models: (i) (M| M | 1 : N | FCFS) (ii
3 In a rectangular game, pay-off matrix of player A is as follows:
how jaguar implements aggregate planning?
#questiSix Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no ass
Classification of documents by information Characteristics: The schemes of classification advocated by Hanson and Grogan are mainly based on the information characteristics of
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
solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0
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!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd