Dynamic programming approach

The problem of choosing whether and when to recycle each off-cut and the size of the cut is a difficult one. Liles (1966) considered dynamic programming approach and Luyben (1988) considered repetitive simulation approach to tackle this problem. Mayur et al. (1970) and Christensen and Jorgensen (1987) tackled it as a dynamic optimisation problem using Pontryagin s Maximum Principle applied to very simplified column models as mentioned in Chapters 4 and 5. 

Gelfand M., Roytberg M. (1993) Prediction of the exon-intron structure by a dynamic programming approach. BioSystems, 30, 173-182. 

Dynamic programming approaches, double dynamic programming As has... 

It is a dynamic programing approach, where the traceback reports the consensus structure of the alignment. 

Process synthesis using value added as an objective function (Umeda, 2004). This chapter revisits dynamic programming approaches. 

Chen, T., Kao, M.-Y, Tepel, M., Rush, J. and Church, G., A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry./. Comput. Biol, 8(3), 325-337 (2001). 

K. G. Shin and N. D. Mckay. A Dynamic Programming approach to Trajectory Planning of Robotic Manipulators, IEEE Transactions on Automatic Control, Vol. AC-31, No. 6. June 1986, pp. 491-500. 

How do we find the best (t) that minimizes (5.144) We describe first a direct approach for an open-loop problem in which we compute the entire optimal trajectory for a specific initial state. Then, we outline an alternative dynamic programming approach that turns the integral equation (5.144) into a corresponding time-dependent partial differential equation, and generates a closed-loop optimal feedback control law. 

---