1969
DOI: 10.1109/tr.1969.5216977
|View full text |Cite
|
Sign up to set email alerts
|

Optimization by Integer Programming of Constrained Reliability Problems with Several Modes of Failure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

1975
1975
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…A variety of algorithms, as summarized in Tillman et al (1977), and more recently by Kuo & Prasad (2000), Kuo & Wan (2007), including exact methods, heuristics and meta-heuristics have already been proposed for the RRAP. An exact optimal solution is obtained by exact methods such as cutting plane method (Tillman, 1969), branch-and-bound algorithm (Chern & Jan, 1986;Ghare & Taylor, 1969), dynamic programming (Bellman & Dreyfus, 1958;Fyffe et al, 1968;Nakagawa & Miyazaki, 1981;Yalaoui et al, 2005), and goal programming (Gen et al, 1989). However, as the size of problem gets larger, such methods are difficult to apply to get a solution and require more computational effort.…”
Section: The Reliability-redundancy Allocation Problem (Rrap)mentioning
confidence: 99%
“…A variety of algorithms, as summarized in Tillman et al (1977), and more recently by Kuo & Prasad (2000), Kuo & Wan (2007), including exact methods, heuristics and meta-heuristics have already been proposed for the RRAP. An exact optimal solution is obtained by exact methods such as cutting plane method (Tillman, 1969), branch-and-bound algorithm (Chern & Jan, 1986;Ghare & Taylor, 1969), dynamic programming (Bellman & Dreyfus, 1958;Fyffe et al, 1968;Nakagawa & Miyazaki, 1981;Yalaoui et al, 2005), and goal programming (Gen et al, 1989). However, as the size of problem gets larger, such methods are difficult to apply to get a solution and require more computational effort.…”
Section: The Reliability-redundancy Allocation Problem (Rrap)mentioning
confidence: 99%
“…A separable function can be analyzed as a multistage process to which the methods of dynamic programming (Bellman and Dreyfus, 1958;Fyffe et al, 1968;Kettelle, 1962;Liittschwager, 1964;Messinger and Shooman, 1970;Misra, 1971b;Woodhouse, 1962) and discrete maximum principle (Fan et al, 1967;Tillman et al, 1968) are applicable. The problem may also be transformed and solved as an integer programming problem (Ghare and Taylor, 1969;Misra, 1971a;Mizukami, 1968;Tillman and Liittschwager, 1967;Tillman, 1969) or by using the Lagrangian multipliers technique (Barlow et al, 1965;Banerjee and Rajamani, 1973;Everett, 1963;Messinger and Shooman, 1970;Misra, 1972). The concept of dominating sequence (or a family of uncominated allocations) has also been used to solve the problem (Barlow et al, 1965;Black and Proschan, 1959;Kettelle, 1962;Messinger and Shooman, 1970;Proschan and Bray, 1965).…”
Section: Availability Of Complex Systemsmentioning
confidence: 99%
“…In 1968 the detailed method to handle RAP was presented, which was planned for the decision of the ideal course of action. 3 After this, some researchers proposed various techniques to address RAP in which the exact methods were carried out at first which were long processing methods [4][5][6][7] and later on heuristic strategies like GA, PSO, hybrid GA-PSO, hybrid PSO, Cuckoo Search, GWO and so on taken into consideration [8][9][10][11][12][13] . These heuristic strategies were giving approximated outcomes in very little time when contrasted with exact methods.…”
Section: Introductionmentioning
confidence: 99%