This paper develops an iterative cutting plane technique for finding an optimal cover solution of the set covering problem with linear fractional functional as its objective function which satisfies certain condition. The method determines a prime cover solution from the optimal solution of the linear fractional functional programming problem derived from the given problem, which is tested for optimality. If it is not an optimal prime cover solution, a linear cut is introduced and the process is continued till the optimal prime cover solution is reached. An example to illustrate the method is incorporated.

No abstract

No abstract

No abstract

No abstract