Abstract
When we construct a program by using a computer, we sometimes interrupt to work and store the program constructed up to this point on a disk or another medium. At that time, we sometimes make a backup copy of the program on another disk. Whether we make a backup copy or not seems to depend on the probability that the program on a disk will be broken by an accident during the work. This kind of problem is formulated by dynamic programming and the optimal strategy is derived with the critical values whose explicit form is analytically derived.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of the Operations Research Society of Japan
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.