Engineering Optimization: Theory and Practice, Fourth Edition

(Martin Jones) #1

554 Dynamic Programming


get the following simplified statement:

f 2 ∗(s 3 ) =opt
x 2

[R 2 (x 2 , s 3 )+f 1 ∗(s 2 )] (9.19)

Thus the number of variables to be considered has been reduced from two (x 1 andx 2 )
to one (x 2 ). A range of possible values ofs 3 must be considered and for each one,x∗ 2
must be found so as to optimize [R 2 +f 1 ∗(s 2 ). The results (] x∗ 2 andf 2 ∗for different
s 3 ) of this suboptimization are entered in a table as shown in Fig. 9.9.

Figure 9.9 Suboptimization of components 1 and 2 for various settings of the input state
variables 3.
Free download pdf