A dynamic programming algorithm for converting decision tables to optimal decision trees is analyzed. The complexity of the algorithm may be defined as the dimension of the domain of the minimal-cost functional. Upper bounds for this complexity are derived under various assumptions. Methods of reducing the dimensionality of the problem utilizing lower bounds for decision costs are also discussed.

For repairable items under the two-dimensional warranty, the manufacturer expenses warranty costs for rectifying the failures occurring over the warranty coverage. Preventive maintenance actions reduce the occurrence intensity of item failures, and hence the warranty cost resulted from corrective maintenance, but bring additional preventive maintenance cost. In this paper, we investigate a peri...

This paper raises the question of solving multi-criteria sequential decision problems under uncertainty. It proposes to extend to possibilistic decision trees the decision rules presented in [1] for non sequential problems. It present a series of algorithms for this new framework: Dynamic Programming can be used and provide an optimal strategy for rules that satisfy the property of monotonicity...

Games with Vector Payoffs : A Dynamic Programming Approach by Vijay Sukumar Kamble Doctor of Philosophy in Engineering – Electrical Engineeing and Computer Sciences University of California, Berkeley Professor Jean Walrand, Chair In several decision-making scenarios in adversarial environments, a decision-maker cares about multiple objectives at the same time. For example, in certain defense op...

In this paper the construction of optimal B-trees for n keys, n key weights, and n+1 gap weights, is investigated. The best algorithms up to now have running time O(k n log n), where k is the order of the B-tree. These algorithms are based on dynamic programming and use step by step construction of larger trees from optimal smaller trees. We present a new algorithm, which has running time O(k n...

This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in decision trees. More precisely, we investigate this problem from the computational viewpoint. When the decision tree is separable (to be defined in the paper), we provide an operational approach to compute an optimal st...

In this paper a stochastic model for a single unit repairable system with Preventive Maintenance (PM) under warranty is analyzed in details by using supplementary variable technique. The cost of repair during warranty is born by the manufacturers, but warranty does not apply to product failure due to user-induced damage such as cracked screen or cracked casing, accident, misuse, physical damage...