A Further Generalized Kettele Algorithm with Multiple Constraints

Abstract J.D. Kettele [2], using dynamic programming, developed a simple algorithm (KA) for the optimal redundancy problem in reliability and life testing problems with a single constraint. F. Proschan and T.B. Bray [3] gave a generalization of Kettele’s dynamic programming algorithm to include multiple constraints. To solve a much broader class of optimization problems than in [2], R.E. Barlow and F. Proschan generalized the Kettele algorithm (GKA) to apply to strictly increasing separable function problems with a single constraint [1]. In this paper, we consider a still more general optimization model and develop a Further Generalized Kettele Algorithm (FGKA) to apply to multiple constraints, etc. As an example, an integer Lexicographic programming model will be solved (corollary 1, section 2). Furthermore, another form of the more general optimization model is pointed out in section 4 of the paper.