A discrete-binary transformation of the reliability redundancy allocation problem (Q1665203)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6925929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A discrete-binary transformation of the reliability redundancy allocation problem |
scientific article; zbMATH DE number 6925929 |
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
0 references
0 references
0 references
0.91256624
0 references
0.87602806
0 references
0.8711953
0 references
0.8682841
0 references
0.8635007
0 references
0.8572974
0 references
0.85655314
0 references
0.8551357
0 references
0.8524573
0 references
