A Discrete-Binary Transformation of the Reliability Redundancy Allocation Problem

Abstract EN

Given a reliability redundancy optimization problem in itsdiscrete version, it is possible to transform suchinteger problem into a corresponding binary problem inlog-time.

A simple discrete-binary transformation is presented inthis paper.

The proposed transformation is illustrated using anexample taken from the reliability literature.

An immediate implication is that a standard exact dynamic programming approach may easily solve instances to optimality that were usually only solved heuristically.