|
Abstract:
Kettele, using dynamic programming, developed a simple algorithm for the optimal redundancy problem in reliability and life testing problems with a single constraint. Proschan Bray gave a generalization of Kettele's dynamic programming algorithm to include multiple constraints. To solve a much broader class of optimization problems barlow Proschan generalized the Kettele algorithm to apply to strictly increasing separable function problems with a single constraint. This paper considers a still more general optimization model and develop a Further Generalized Kettele Algorithm to apply to multiple constraints, etc. As an example, and integer Lexicographic programming model will be solved. Furthermore, another form of the more general optimization model is pointed out in section 4 of the paper. (KR)
| Limitations: |
 APPROVED FOR PUBLIC RELEASE |
| Description: |
Technical rept. |
| Pages: |
24 |
| Report Date: |
MAR 88 |
| Contract Number: |
N00014-86-C-0398, $NSF-SES85-2 |
| Report Number: |
A450691 |
|
|
|
|
|
Keywords relating to this report:
Email This Abstract
