Reliability optimization of a complex system by the stochastic branch and bound method
DOI10.1007/s10559-008-9000-5zbMath1143.90325OpenAlexW2142137848MaRDI QIDQ946784
B. O. Onishchenko, Vladimir I. Norkin
Publication date: 24 September 2008
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-008-9000-5
stochastic programmingdynamic programmingdiscrete optimizationreliability optimizationmajorantsminorantsoptimal redundancypermutable relaxationstochastic branch and bound algorithmstochastic minorants
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39)
Related Items (1)
Cites Work
- Unnamed Item
- Reliability analysis of systems described by fault trees with efficiency
- On optimization properties of functions, with a concave minorant
- A branch and bound method for stochastic global optimization
- Piyavskij's method for solving the general global optimization problem
- Maximum-reliability parallel-serial structure with two types of component faults
- Minorant methods of stochastic global optimization
- On Optimal Allocation of Indivisibles Under Uncertainty
- Reliability optimization algorithm for a compound system with different backup elements in subsystems
- The problem of synthesis of reliable networks
This page was built for publication: Reliability optimization of a complex system by the stochastic branch and bound method