A Novel Approach for Solving Quadratic Fractional Programming Problems
Yazarlar (3)
Yıldız Teknik Üniversitesi, Türkiye
Yıldız Teknik Üniversitesi, Türkiye
Dr. Öğr. Üyesi Gizem Temelcan ERGENECOŞAR
İstanbul Aydın Üniversitesi, Türkiye
| Makale Türü |
Özgün Makale
|
| Makale Alt Türü | ESCI dergilerinde yayınlanan tam makale |
| Dergi Adı | Croatian Operational Research Review |
| Dergi ISSN | 1848-0225 Wos Dergi Scopus Dergi |
| Dergi Tarandığı Indeksler | ESCI |
| Makale Dili | İngilizce |
| Basım Tarihi | 12-2018 |
| Cilt No | 9 |
| Sayı | 2 |
| Sayfalar | 199 / 209 |
| DOI Numarası | 10.17535/crorr.2018.0015 |
| Makale Linki | http://dx.doi.org/10.17535/crorr.2018.0015 |
| Özet |
| In this paper, quadratic fractional programming (QFP) problems involving a factorized or non-factorized objective function and subject to homogenous or non-homogenous constraints are considered. Our proposed approach depends on a computational method that converts the QFP problem into a linear programming (LP) problem by using a Taylor series to solve the problem algebraically. This approach, based on the solution of LP problems, can be applied to various types of nonlinear fractional programming problems containing nonlinear constraint (s), and minimizes the total execution time on iterative operations. To illustrate the solution process, two examples are presented and the proposed approach is compared with other two existing methods for solving QFP problems. |
| Anahtar Kelimeler |
| linear programming problem | quadratic fractional programming problem | Taylor series |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| WoS | 7 |
| SCOPUS | 9 |
| Google Scholar | 13 |