On posynomial fractional programming problems

The posynomial fractional programming (PFP) problem arises from the summation minimization of several quotient terms, which are composed of posynomial terms appearing in the objective function subject to given posynomial constraints. This paper proposes an approximate approach to solving a PFP problem. A linear programming relaxation is derived for the problem based on piecewise linearization techniques, which first convert a posynomial term into the sum of absolute terms; these absolute terms are then linearized by some linearization techniques. The proposed approach could reach a solution as close as possible to a global optimum.