Abstract
An item has probabilityp 0 of not being workable. Before, going into use it has to be controlled by some deliberately chosen checksC i which costsc i ≥0,1≤i≤n. Total checking costs must be not larger thanc 0>0. It may happen that a check breaks a workable item, and failures may be overlooked. The problem is to determine an optimal sequence of checks subject to the cost constraints, such that the probability is maximized that an item leaving the checks is workable. In [1] this problem is solved by W. Stadje, but numerically the solution method only is applicable to problems of modest size.
In this paper a simple reformulation of the original problem is presented. This first allows a simpler derivation of some of the results in [1]. Further, a dynamic programming algorithm is presented, which is pseudopolynomial, if costsc i are integers. It then requiresO(n·c 0) time.
Similar content being viewed by others
References
Stadje W (1992) An Optimal Choice Problem for a Set of Checking Procedures. ZOR 36:447–457
Lamagna EA (1987) Infeasible Computation: NP-Complete Problems. ABACUS 4 no. 3:18–33
Bertsekas DP, Shreve SE (1978) Stochastic Optimal Control: The Discrete Time Case, Academic Press, New York
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kadelka, D. A note on an optimal choice problem. ZOR Zeitschrift für Operations Research Methods and Models of Operations Research 38, 1–9 (1993). https://doi.org/10.1007/BF01416001
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01416001