Abstract

In this paper, we have formulated the problem of allocation of repairable components within subsystems of a series-parallel system as a multi-objective non linear programming problem. A solution procedure using D1 – distances in the lexicographic goal programming approach is proposed. The solution corresponding to the minimum D1 – distances gives the best compromise solution. A numerical example is given to illustrate the procedure.

Author: Irfan Ali, M. Faisal Khan and Abdul Bari

Received on: December, 2011

Accepted on: