A Polynomial-Time Redundancy Allocation Model
Benedict Nmah

Abstract
Redundancy optimization models are often NP-hard; nonetheless, there exist models of redundancy allocation that can be solved in polynomial time. This paper presents one of such models where for a positive integer greater than 1, a series of independent subsystems are all built from identical components; the subsystems fail only if all components in the subsystems fail. Particularly, this paper deals with the special case in which the objective vector takes the form where is an integer with .

Full Text: PDF     DOI: 10.15640/arms.v10n2a3