Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 276234, 6 pages
Research Article

A Discrete-Binary Transformation of the Reliability Redundancy Allocation Problem

1IE Business School, IE University, Maria de Molina 31B, 28006 Madrid, Spain
2Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146 Hamburg, Germany
3Escuela de Ingeniera Industrial, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, 2362807 Valparaíso, Chile

Received 10 December 2014; Accepted 4 April 2015

Academic Editor: Wei-Chiang Hong

Copyright © 2015 Marco Caserta and Stefan Voß. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Given a reliability redundancy optimization problem in its discrete version, it is possible to transform such integer problem into a corresponding binary problem in log-time. A simple discrete-binary transformation is presented in this paper. The proposed transformation is illustrated using an example 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.