A Novel Approach for Solving Quadratic Fractional Programming Problems
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.
Downloads
Published
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
