OPTIMAL SEQUENTIAL BACKUP STRATEGY UNDER CONSTRAINED RESOURCES

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.