Exact cost minimization of a series-parallel system

Authors Francisco J. Castro-Jiménez, J. Gago, I. Hartillo, Justo Puerto, J. M. Ucha

Publication date 15 March 2012

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Reliability, availability, maintenance, inspection in operations research (90B25) Integer programming (90C10)

Abstract: The redundancy allocation problem is formulated minimizing the design cost for a series-parallel system with multiple component choices whereas ensuring a given system reliability level. The obtained model is a nonlinear integer programming problem with a non linear, non separable constraint. We propose an algebraic method, based on Gr"obner bases, to obtain the exact solution of the problem. In addition, we provide a closed form for the required Gr"obner bases, avoiding the bottleneck associated with the computation, and promising computational results.

This page was built for publication: Exact cost minimization of a series-parallel system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231659)