What people are saying - Write a review
We haven't found any reviews in the usual places.
SEQUENTIAL DECISION PROCESSES IN DISCRETE TIME
SEQUENTIAL DECISION PROCESSES IN CONTINUOUS TIME
h APPLICATIONS TO REPLACEMENT PROBLEMS
1 other sections not shown
a^-process admissible intermediate alternatives application assumed assumption behavior binomial expansion bladder fails change No change coefficients COIN-TOSSING GAME column vector conditional expected continuous-time correct calls corresponds cost per period decision models decision procedures denote determine discrete-time Dynamic Programming equations evaluate example expected return filling station fixed strategy follows formulation group replace h successes identical interval iteration linear programming marginal probability Markov process non-sequential number of customers number of initial number of open obtained occur open stations Operations Research optimal policies optimal solution optimal strategy parameters payoff preventive replacement probabilistic probability distribution Pure Strategies queuing random variable randomization recurrence relation replacement problem restrictions return per unit Section sequential decision problems sequential decision process servers service capacity simple model situation Solution by Linear Specific Trial steady-state strategy vector Suppose total expected cost total number transition probabilities Trials Let variables xi k(i zero