A note on a global approach for general 0–1 fractional programming

摘要

Based on an approach recently proposed for obtaining global optimal solution of general 0–1 fractional programming (G-FP) problem, a theorem is presented in this research. Through this theorem, the nonlinear terms appearing in the formulation transformed from G-FP can be directly replaced by a set of linear inequalities. The G-FP problem can hence be easily and more efficiently solved as a mixed integer program.