A Novel Approach for Solving Quadratic Fractional Programming Problems

  • Inci Albayrak Department of Mathematical Engineering, Yildiz Technical University, Istanbul, Turkey
  • Mustafa Sivri Department of Mathematical Engineering, Yildiz Technical University, Istanbul, Turkey
  • Gizem Temelcan Department of Computer Programming, Istanbul Aydin University, Istanbul, Turkey

Abstract

In this paper, the quadratic fractional programming (QFP) problems involving a factorized or not-factorized objective function and subject to homogenous or non-homogenous constraints is considered. Our proposed approach depends on a computational method that converts 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 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.

Published
2018-12-11
Section
CRORR Journal Regular Issue