Optimal allocation of multi-state elements in linear consecutively connected systems with vulnerable nodes.

DOI10.1016/S0377-2217(02)00506-4zbMath1137.90454MaRDI QIDQ1405238

Gregory Levitin

Publication date: 25 August 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

systemsGenetic algorithmLinear consecutively connectedMulti-state elementsSystem survivabilityUniversal generating function

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

On anonymous and weighted voting systems ⋮ Achievable hierarchies in voting games with abstention ⋮ Defense against an opportunistic challenger: theory and experiments ⋮ Optimal resource allocation for security in reliability systems ⋮ Optimal completed work dependent loading of components in cold standby systems ⋮ Connectivity modeling and optimization of linear consecutively connected systems with repairable connecting elements ⋮ Strategic defense and attack for series and parallel reliability systems ⋮ Power in voting rules with abstention: an axiomatization of a two components power index ⋮ False targets efficiency in defense strategy ⋮ On the enumeration of bipartite simple games ⋮ Protecting complex infrastructures against multiple strategic attackers ⋮ A cross entropy approach to design of reliable networks ⋮ Separation in homogeneous systems with independent identical elements ⋮ Computation of several power indices by generating functions

Cites Work

• Multistate consecutively-connected systems
• Reliability of Systems with Consecutive Minimal Cutsets
• Recursive Algorithm to Evaluate the Reliability of a Consecutive-k-out-of-n:F System
• Unnamed Item
• Unnamed Item
• Unnamed Item