Finite State Markovian Decision Processes |
From inside the book
16 pages matching Bibliographical Remarks in this book
Page viii
Page ix
Where's the rest of this book?
Results 1-3 of 16
Contents
Problems to Be Treated | 5 |
Finite Horizon Expected Cost Minimization | 11 |
Bibliographical Remarks | 17 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
a e K₁ A₁ ú(i AOQL Appendix arbitrary Bibliographical Remarks Chapter constraints continuous function convex set Corollary defined denote Derman discounted cost criterion dual linear programming dual problem dynamic programming E{wy equality in 13 equations expected average cost expected discounted cost extreme point feasible solution finite number given Hence Hº(i Horizon Problem inspection Lemma lim inf Linear Programming Formulations linear programming problem Markov chain Markovian decision process Math maximize method of successive minimize subject nondecreasing obtained optimal policy optimal solution optimal stopping OR(i P₁ policy improvement iteration policy improvement procedure policy Re CD PR{Y₁ primal problem R₁ R₂ random variables recurrent satisfies stochastic process strict inequality holding successive approximations Suppose takes action transient transition probabilities traveling salesman problem UR(i v₁ Veinott VR(i W₁ Y₁ Y₂ YR(i α Σ Σ Σ ΣΣ