We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is developed. The proposed method of cuts generation, separation and strengthening is compared to the Gomory, linear branching and coordinated cutting plane methods. The computational results show that the proposed method is promising but becomes complicated as number of variables increases.