Published Paper Details:

This article represents an interval branch and bound (B & B technique) constrained global optimization method developed by Karmakar & Bhunia [17] for Sum of Ratios Fractional Programming Problems (FPPs). The constraints of this kind of FPPs involves sum of ratios fractional type constraints. There exist several efficient constraint-handling techniques to find global optimizers for various problems; but, not so effective for general sum of ratios fractional type constraints. A more updated and general interval ranking definitions in terms of decision maker's view point has been used to modify this B & B technique. The method is mainly based on the multi-section splitting criterion of the accepted/prescribed search region, calculation of interval inclusion of the fractional objectives and constraints and the selection of subregion depending on the modified interval order relations said earlier. Adequate number of numerical examples selected form the existing literature have been solved and compared in support of this technique.