Help


from Brown Corpus
« »  
The set of equations ( 5 ), ( 6 ), and the starting equation ( 7 ) is of a recursive type well suited to programming on the digital computer.
In finding the optimal R-stage policy from that of Af stages, only the function Af is needed.
When Af has been found it may be transferred into the storage location of Af and the whole calculation repeated.
We also see how the results may be presented, although if n, the number of state variables, is large any tabulation will become cumbersome.
A table or set of tables may be set out as in Table 2.1.

1.825 seconds.