Technical Note—On an Algorithm of Ghare and Taylor

Dennis W. McLeavey
Additional contact information
Dennis W. McLeavey: The University of Western Ontario, London, Ontario, Canada

Operations Research, 1973, vol. 21, issue 6, 1315-1318

Abstract: This note points out an example in which an algorithm reported by P. M. Ghare and R. E. Taylor [ Opns. Res. 17, 838–847 (1969)] for determining optimum redundancy in a series system does not produce an optimal solution. It presents the Ghare-Taylor solution along with a better feasible solution, and explains the necessary corrections to the Ghare-Taylor algorithm and the cause of the difficulty with it. The note thus questions the validity of the computer times reported by Ghare and Taylor and indicates a source yielding computer times for the corrected algorithm.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.6.1315 (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:21:y:1973:i:6:p:1315-1318

Access Statistics for this article

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