Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method

Authors:
J. Gago;I. Hartillo;J. Puerto;J. M. Ucha
Affiliations:
-;-;-;-
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 0

An algebraic geometry algorithm for scheduling in presence of setups and correlated demands

Mathematical Programming: Series A and B
A branch and bound algorithm for designing reliable systems at a minimum cost

Applied Mathematics and Computation
The NEOS Server

IEEE Computational Science & Engineering
Buchberger Algorithm and Integer Programming

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Reliability optimization of a series system with multiple-choice and budget constraints using an efficient ant colony approach

Expert Systems with Applications: An International Journal
An exact rational mixed-integer programming solver

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
On the computational complexity of reliability redundancy allocation in a series system

Operations Research Letters
Valid Linear Programming Bounds for Exact Mixed-Integer Programming

INFORMS Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The redundancy allocation problem is formulated minimizing the design cost for a series-parallel system with multiple component choices while ensuring a given system reliability level. The obtained model is a nonlinear integer programming problem with a nonlinear, nonseparable constraint. We propose a method based on the construction of a test set of an integer linear problem, which allows us to obtain an exact solution of the problem. It is compared to other approaches in the literature and standard nonlinear solvers.