## Dynamic programming (with management applications) |

### From inside the book

18 pages matching **transition probability matrix** in this book

#### Page 172

Where's the rest of this book?

Results 1-3 of 18

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

THE VALUE ITERATION ALGORITHM l | 1 |

DETERMINISTIC APPLICATIONS | 43 |

FINIT E STAGE MARKOV PROGRAMMING | 82 |

Copyright | |

3 other sections not shown

### Other editions - View all

### Common terms and phrases

Action Trial Value actions and values boats column vector computational corresponds current policy deﬁned denoted Determine deterministic discount factor discounted returns dynamic programming ﬁnd ﬁnding ﬁnite ﬁrst ﬁsh ﬁxed fundamental matrix gain optimal policies gain rate given inﬁnite stage linear simultaneous equations marketing example Markov decision problem Markov process Max r(n maximise mean total return minimises minmax month optimal action optimal path optimal plan optimal process optimal value optimisation overhaul partitioning problem plan is followed planning horizon policy evaluation operation policy improvement routine proﬁt random variable raw material recurrence relation relative bias values return associated return r(i semi-Markov semi-Markov process separability condition shortest path problem shown in Table Slotting Machine Example stage Markov stage return Stage State Action stochastic stochastic matrix stock level summarised terminal values test quantity transition equation transition probability matrix transition returns unichain units value iteration algorithm value iteration method value table zero