Computational Techniques for Optimizing Systems With Standby Redundancy.

Abstract

Three methods are used to solve the following problem: for P, a positive constant, maximize (P. Reliability -cost) of a system with standby redundancy. The results show that a method which rounds a nonintegar solution to the nearest integar solution can lead to tremendous mistakes. However, neither a well known dynamic programming algorithm nor a previously developed branch and bound technique are able to solve large size problems. The solution of problems of large dimension thus requires the use of the noninteger solution of the first method to limit the number of possible solutions when using either the dynamic programming algorithm or a modified branch and bound technique. With this assitance, the branch and bound technique is able to solve large problems in a short amount of computational time. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1971
Accession Number
AD0723105

Entities

People

  • Claude Henin

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Dynamic Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics
  • Redundancy
  • Reliability

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Graph Algorithms and Convex Optimization.
  • Inertial Navigation Systems.