Linearization of 0-1 multi-quadratic fractional programming problem

The considered problem in this paper is a 0-1 Multi-Quadratic Fractional Programming Problem (0-1MQFP) without the restriction of positive denominators. The two important contributions of the paper are: (a) it proposes a linearization technique to solve any type of 0-1MQFP problem; and (b) when applied to the 0-1MQFP problem with the restriction of positive denominators, it requires less number of constraints and variables as compare with the available techniques in the literature. The problem is proved to be NP-hard. The linearization process is summarized with the help of an algorithm and flow chart, and further illustrated by examples. Codes for linearizing 0-1MQFPP are given in the appendix to the paper.