A Further Generalized Kettele Algorithm with Multiple Constraints

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1988
Accession Number
ADA196054

Entities

People

  • Abraham Charnes
  • Di Zhang

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Business Administration
  • Interdisciplinary Science
  • Mathematics
  • Military Research
  • Numbers
  • Operations Research
  • Optimization
  • Real Numbers
  • Real Variables
  • Redundancy
  • Reliability
  • Sequences
  • Spare Parts
  • Universities
  • Vector Spaces

Readers

  • Operations Research