Use of Geometric Programming to Maximize Reliability Achieved by Redundancy

A. J. Federowicz and M. Mazumdar
Additional contact information
A. J. Federowicz: Westinghouse Research Laboratories, Pittsburgh, Pennsylvania
M. Mazumdar: Westinghouse Research Laboratories, Pittsburgh, Pennsylvania

Operations Research, 1968, vol. 16, issue 5, 948-954

Abstract: This paper considers the problem of optimum allocation of redundant elements in a simple series sytem (maximizing system reliability subject to several linear cost constraints). Under the approximation that the components of the redundancy vector can be treated as continuous variables, the paper formulates this optimization problem as a geometric programming problem, describes techniques for obtaining numerical solutions in general, and obtains asymptotic closed-form solutions. A standard numerical example is used to illustrate that the asymptotic solution, when suitably rounded, compares favorably with the discrete optimal solution.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.5.948 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:5:p:948-954

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().