A Computational Complexity Analysis of an Algorithm for Reliability Optimization
Journal of Advances in Mathematics and Computer Science · pp. 18–25 · Published 29 Jan 2015
10.9734/BJMCS/2015/14835Abstract
Least-cost allocation of redundancy within subsystems of a series-parallel system to meet a requirement for system reliability may be modelled as a nonlinear integer program in which the number of variables is equal to the number of subsystems. The data are the system requirement, the reliabilities of the identical components within each subsystem and the costs of these components. The model has a linear cost function as its objective and a single non-linear constraint that enforces the requirement for system reliability. The continuous counterpart of the discrete problem can be solved by solving a polynomial equation. The main result of this paper is a bound on the effort required to obtain from the solution of the continuous relaxation the optimal numbers of redundant components for the subsystems.
Cited by 2
Benedict K. Nmah · 2016
Woodruff Library, W. Robert · 2016
Related research
- The Computational Limit to Quantum Determinism and the Black Hole Information Loss Paradox — shares topic coverage
- Computational Solution to Quantum Foundational Problems — shares topic coverage
- Acceleration of Biological Sequence Alignment Using Residue Number System — shares topic coverage
- A Single-machine Scheduling with Generalized Due Dates to Minimize Total Weighted Late Work — shares topic coverage
- Achieving System Reliability with the Fewest Identical Components — shares topic coverage
Article metrics
Real usage data collected on this platform.
11
Page views
0
PDF downloads
0
Outbound clicks
2
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.