An exact algorithm for cost minimization in series reliability systems with multiple component choices

In this paper, we present an exact method for cost minimization problems in series reliability systems with multiple component choices. The problem can be modelled as a nonlinear integer programming problem with a nonseparable constraint function. The method is of a combined Lagrangian relaxation an...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 181; číslo 1; s. 732 - 741
Hlavní autoři: Ruan, Ning, Sun, Xiaoling
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY Elsevier Inc 01.10.2006
Elsevier
Témata:
Branch-and-bound method
Calculus of variations and optimal control
Cost minimization
Exact sciences and technology
Lagrangian bound
Mathematical analysis
Mathematics
Multiple component choice
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming
Numerical methods in mathematical programming, optimization and calculus of variations
Reliability system
Sciences and techniques of general use
Reliability system
Cost minimization
Branch-and-bound method
Multiple component choice
Lagrangian bound
Lower bound
Branch and bound method
Non linear programming
System reliability
Algorithm
Integer programming
Efficiency
Applied mathematics
Relaxation method
Lagrangian method
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we present an exact method for cost minimization problems in series reliability systems with multiple component choices. The problem can be modelled as a nonlinear integer programming problem with a nonseparable constraint function. The method is of a combined Lagrangian relaxation and linearization method. A Lagrangian bound is obtained by solving the dual of a separable subproblem. An alternative lower bound is derived by 0–1 linearization method. A special cut-and-partition scheme is proposed to reduce the duality gap, thus ensuring the convergence of the method. Computational results are reported to show the efficiency of the method.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2006.02.001