en عمومى General پژوهشي Research paper <p style="margin: 0px 0px 10.66px;"><font face="Calibri">We consider a fractional program with both linear and quadratic equation in numerator and denominator<span style="margin: 0px;">&nbsp; </span>having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a<span style="margin: 0px;">&nbsp; </span>second order cone programming (SOCP)<span style="margin: 0px;">&nbsp; </span>problem.</font></p> <p style="margin: 0px 0px 10.66px;"><font face="Calibri"><span style="margin: 0px;">&nbsp;</span>For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The problem is solved with SDO relaxation and the obtained results are compared with the interior point method (IPM), a sequential quadratic programming (SQP) approach, an active set strategy and a genetic algorithm. It is observed that the SDO relaxation method is much more accurate and faster than the other methods. Finally,a few numerical examples are worked through to demonstrate the applicability of the procedure.</font></p> Fractional Programming, Second Order Cone, SDP Relaxation. 33 42 http://ijmsi.ir/browse.php?a_code=A-10-3467-1&slc_lang=en&sid=1 A. Sadeghi : a-sadeghi@phdstu.scu.ac.ir 10031947532846007795 10031947532846007795 No Faculty of Mathematical Sciences and Computer, Shahid Chamran University of Ahvaz, Iran. M. Saraj msaraj@scu.ac.ir 10031947532846007796 10031947532846007796 Yes Faculty of Mathematical Sciences and Computer, Shahid Chamran University of Ahvaz, Iran. N. Mahdavi Amiri nezaam@sharif.edu 10031947532846007797 10031947532846007797 No Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran.