An exact algorithm for cost minimization in series reliability systems with multiple component choices
From MaRDI portal
Publication:945416
DOI10.1016/j.amc.2006.02.001zbMath1148.65043OpenAlexW1994062310MaRDI QIDQ945416
Publication date: 12 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.02.001
numerical examplesbranch-and-bound methodreliability systemcost minimizationLagrangian boundmultiple component choice
Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items
Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method ⋮ An improved test set approach to nonlinear integer problems with applications to engineering design ⋮ Reliability and cost analysis of series system models using fuzzy parametric geometric programming ⋮ Finding multiplies solutions for non-linear integer programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithm for concave knapsack problems: linear underestimation and partition method
- Reliability optimization of a series system with multiple-choice and budget constraints
- Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
- A nonlinear knapsack problem
- Towards strong duality in integer programming
- Optimal Reliability Allocation with Discrete Cost-Reliability Data for Components
- A New Technique to Optimize System Reliability
- Optimization of system reliability: a survey of problems and techniques†
- An efficient algorithm to solve integer-programming problems arising in system-reliability design
- A Note on Heuristic Methods in Optimal System Reliability
- Reliability Optimization Problems with Multiple Constraints
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- A branch and bound algorithm for designing reliable systems at a minimum cost
- A pegging algorithm for the nonlinear resource allocation problem