2019
DOI: 10.1007/978-3-030-28377-3_52
|View full text |Cite
|
Sign up to set email alerts
|

Active Redundancy Allocation in Complex Systems by Using Different Optimization Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…where is the Lagrange multiplier. Thus, instead of maximizing the function R rs given by (20) within the cost constraint (21), we have to maximize the Lagrange function given by (22) without constraints. For this purpose, the following system with partial derivatives must be solved:…”
Section: Analytical Approach For Active Redundancymentioning
confidence: 99%
See 4 more Smart Citations
“…where is the Lagrange multiplier. Thus, instead of maximizing the function R rs given by (20) within the cost constraint (21), we have to maximize the Lagrange function given by (22) without constraints. For this purpose, the following system with partial derivatives must be solved:…”
Section: Analytical Approach For Active Redundancymentioning
confidence: 99%
“…In Ref. 20, we introduced an original algorithm called \Pairwise Hill Climbing" (PHC) to address this issue. For our particular problem, a classic hill climbing method cannot be applied because simply adding components to the subsystems would likely cause the violation of the cost constraint.…”
Section: Pairwise Hill Climbingmentioning
confidence: 99%
See 3 more Smart Citations