On polynomial mixed 0–1 fractional programming problems

This paper proposes a new method of solving polynomial mixed 0–1 fractional programming (P01FP) problems to obtain a global optimum. Given a polynomial 0–1 term x1x2,…,xny, where xi is a 0–1 variable and y is a continuous variable; we develop a linearization technique to transfer the x1x2,…,xny term into a set of mixed 0–1 linear inequalities. Based on this technique, the P01FP can then be solved by a branch-and-bound method to obtain the global solution.