Achieving System Reliability with the Fewest Identical Components
Benedict Nmah *
Department of Mathematics, Morehouse College, 830 Westview Drive, S.W., Atlanta, GA 30314, USA.
*Author to whom correspondence should be addressed.
Abstract
Generally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.
Keywords: NP-hard, polynomially bounded algorithms, redundancy allocation, discrete optimization models
How to Cite
Nmah, Benedict. 2017. “Achieving System Reliability With the Fewest Identical Components”. Journal of Advances in Mathematics and Computer Science 24 (6):1-9. https://doi.org/10.9734/JAMCS/2017/36521.
Downloads
Download data is not yet available.