دوره 14، شماره 2 - ( 7-1398 )                   جلد 14 شماره 2 صفحات 33-42 | برگشت به فهرست نسخه ها

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Saraj M, Sadeghi A, Mahdavi Amiri N. Solving A Fractional Program with Second Order Cone Constraint. IJMSI. 2019; 14 (2) :33-42
URL: http://ijmsi.ir/article-1-1314-fa.html
Solving A Fractional Program with Second Order Cone Constraint. مجله علوم ریاضی و انفورماتیک. 1398; 14 (2) :33-42

URL: http://ijmsi.ir/article-1-1314-fa.html


چکیده:  

We consider a fractional program with both linear and quadratic equation in numerator and denominator  having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a  second order cone programming (SOCP)  problem.

 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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA

کلیه حقوق این وب سایت متعلق به نشریه علوم ریاضی و انفورماتیک می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2019 All Rights Reserved | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb