A discrete-binary transformation of the reliability redundancy allocation problem (Q1665203): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2015/276234 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1500462789 / rank | |||
Normal rank | |||
Revision as of 19:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A discrete-binary transformation of the reliability redundancy allocation problem |
scientific article |
Statements
A discrete-binary transformation of the reliability redundancy allocation problem (English)
0 references
27 August 2018
0 references
Summary: Given a reliability redundancy optimization problem in its \textit{discrete} version, it is possible to transform such integer problem into a corresponding \textit{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.
0 references
