Abstract
In this paper, I have expanded, the given algorithms [11,12] in to Quadratic Fractional Programming Problem (QFPP), I have used two methods to solve the problem one of them is Modified Simplex Method and the other Feasible Direction Development. And, then a good results I have been obtained as compared the ways of solution of the two methods. The computer application of our algorithms has also been discussed by solving constructed numerical example using Matlab2011 version 7.12.0.635 (R2011a). Finally this paper ends up with some conclusions.
Sign-in/Register to access full text options 
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.
