Title :
Redundancy Optimization Through Simplex Pattern Search
Author :
Pal, M.N. ; Bhattacharjee, Manish C.
Author_Institution :
Indian Institute of Management Calcutta; P.O. Box 16757; Calcutta 700 027, INDIA; Assistant Professor of O.R. and Production Management.
fDate :
6/1/1978 12:00:00 AM
Abstract :
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.
Keywords :
Costs; Dynamic programming; Integer linear programming; Maintenance; Mathematical programming; Queueing analysis; Redundancy; Reliability theory; Steady-state; Upper bound; Busy period; Redundancy optimization; Repairable subsystems; Separable programming; Simplex pattern search;
Journal_Title :
Reliability, IEEE Transactions on
DOI :
10.1109/TR.1978.5220277
