Answers are grounded in this paper and cite their sources.
An algorithm for the heuristic solution of redundancy optimization problems is presented. There may be any number of constraints which need not be linear. For selecting the stage where redundancy is to be added, a heuristic criterion is introduced which takes into account the relative increment in reliability versus decrement in slacks. The algorithm is simple and requires minimum computation.
No takes yet. Share an insight, caveat, or question.
Aggarwal et al. (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: