Abstract
A two-dimensional dynamic programming problem is posed. By relaxing some of the restraints on the problem it is reduced to a standard dynamic programming problem. Results are quoted from a particular case study.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
