Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
From MaRDI portal
Publication:1863879
DOI10.1023/A:1016541912439zbMath1035.90087MaRDI QIDQ1863879
Publication date: 12 March 2003
Published in: Optimization and Engineering (Search for Journal in Brave)
branch and bound algorithmreliability optimizationseries systemfathoming conditionoptimal redundancy assignment
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46) Discrete location and assignment (90B80)
Related Items (9)
Reliability and cost analysis of series system models using fuzzy parametric geometric programming ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints ⋮ An exact algorithm for cost minimization in series reliability systems with multiple component choices ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Reliability stochastic optimization for a series system with interval component reliability via genetic algorithm ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems ⋮ An exact algorithm for optimal redundancy in a series system with multiple component choices ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method
This page was built for publication: Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
