论文信息 - Redundancy Optimization Through Simplex Pattern Search

Redundancy Optimization Through Simplex Pattern Search

Optimal allocation of redundancy in a series system with separately maintained repairable subsystems subject to multiple constraints is investigated for maximizing system reliability using simplex pattern search and separable programming. The constraints, besides the usual ones, include one based on s-expected busy periods of the maintenance facilities. A numerical example illustrates the method.

M. C. Bhattacharjee | M. N. Pal

[1] R. Bellman,et al. Dynamic Programming and the Reliability of Multicomponent Devices , 1958 .

[2] Jr. John D. Kettelle. Least-Cost Allocations of Reliability Investment , 1962 .

[3] John A. Nelder,et al. A Simplex Method for Function Minimization , 1965, Comput. J..

[4] T. A. Bray,et al. OPTIMUM REDUNDANCY UNDER MULTIPLE CONSTRAINTS , 1965 .

[5] F. A. Tillman,et al. Integer Programming Formulation of Constrained Reliability Problems , 1967 .

[6] M. Mazumdar,et al. Use of Geometric Programming to Maximize Reliability Achieved by Redundancy , 1968, Oper. Res..

[7] Koichi Mizukami. Optimum Redundancy for Maximum System Reliability by the Method of Convex and Integer Programming , 1968, Oper. Res..

[8] R. E. Taylor,et al. Optimal Redundancy for Reliability in Series Systems , 1969, Oper. Res..

[9] K. Misra. Reliability optimization through sequential simplex search , 1973 .