A Discrete-Binary Transformation of the Reliability Redundancy Allocation Problem

Marco Caserta and Stefan Voß

Mathematical Problems in Engineering, 2015, vol. 2015, 1-6

Abstract:

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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/276234.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/276234.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:276234

DOI: 10.1155/2015/276234

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().