.png){kind=icon}
.png){kind=icon}
Return
Redundancy allocation for series-parallel systems using integer linear programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TR.2008.927807.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem, and the choice of components are the-decision variables. In this paper, we propose an integer linear programming approach that gives an approximate feasible solution, close to the optimal solution, together with an upper bound on the optimal reliability. We show that integer linear programming is a useful approach for solving this reliability problem. The mathematical programming model is relatively simple. Its implementation is immediate by using a mathematical programming language, and integer linear programming software. And the computational experiments show that the performance of this approach is excellent based on a comparison with previous results.
Keywords:
computational experiments
integer linear programming
multiple component choices
redundancy allocation
system reliability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
2.7K
Citations:
8.5K