Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T02:50:09.736Z Has data issue: false hasContentIssue false
  • English
  • Français

A GOLD-MINING PROBLEM

OPTIMAL BACKUP STRATEGY IN COMPUTER PROGRAMS

Published online by Cambridge University Press:  01 April 2000

Minoru Sakaguchi  and
Toshio Hamada
Minoru Sakaguchi
Affiliation:
3-26-4 Midorigaoka, Toyonaka, Osaka 560-0002, Japan
Toshio Hamada
Affiliation:
Department of Management Sciences, Kobe University of Commerce, Nishi-ku, Kobe 651-2197, Japan, E-mail: hamada@kobeuc.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We study an example of R. Bellman's gold-mining problem related to a programming job on the computer. The problem is formulated by dynamic programming and the optimal strategy is explicitly derived. The Bayesian version when the parameter involved is unknown is also solved by the same method. It is shown that the optimal strategy in each of two versions has the “no-island” (or, in other words, “control-limit”) property.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 14 , Issue 2 , April 2000 , pp. 151 - 160
Copyright
© 2000 Cambridge University Press