AN APPLICATION OF THE BRANCH-AND-BOUND METHOD TO THE CATALOGUE ORDERING PROBLEM

Abstract

A parallel (or series) system of components is considered. Each component of the system is assumed to be chosen from a set of available components each with a specified reliability and a specified cost. The problem, that of minimizing the cost of the system while guaranteeing a specified system reliability, can be written as a zero-one integer program. A branch-and-bound algorithm is the suggested solution method.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1968
Accession Number
AD0675035

Entities

People

  • Leonard J. Jacobson

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Catalogs
  • Classification
  • Coefficients
  • Contractors
  • Contracts
  • Instructions
  • Integer Programming
  • Linear Programming
  • Military Research
  • Operations Research
  • Reliability
  • Security
  • Simplex Method
  • United States

Readers

  • Life Cycle Cost Analysis
  • Operations Research
  • Systems Analysis and Design