Comparison of Reliability Allocation Optimization Methods

Abstract

The reliability allocation problem has previously been solved by methods other than the classical optimization methods. The thesis brings together and compares three allocation models that are based on optimization methods. It was found that dynamic programming gives the optimal solution to the allocation problem. The model based on Lagrange multipliers gave a solution that was within 0.5% of the optimal solution given by dynamic programming. The linear programming algorithm gave a solution that was within 0.6% of the optimal solution.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1969
Accession Number
AD0867340

Entities

People

  • William Z. Spivey

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computer Programming
  • Computer Programs
  • Computers
  • Dynamic Programming
  • Engineering
  • Evolutionary Algorithms
  • Government (Foreign)
  • Linear Programming
  • Mathematical Programming
  • Operating Systems
  • Optimization
  • Random Number Generators
  • Reliability
  • Schools
  • Standards

Readers

  • Computational Modeling and Simulation
  • Operations Research