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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
