Fractional programming with absolute-value functions

This paper considers a fractionals functionals programming problem of the type: x is unrestricted. In general, adjacent extreme point (simplex-type) methods cannot be used to solve this class of problems. However, this work presents the conditions under which simplex-type algorithms can be used to arrive at an optimal solution for a fractional programming problem with an absolute value objective function.