Solving Quadratic Fractional Programming Problem via Feasible Direction Development and Modified Simplex Method

Volume 15 , Issue 2 , March 2013 , Pages 45-52

Authors

Basiya K. Abdulrahim 1

1 Faculty of Education, University of Garmian

DOI logo 10.17656/jzs.10245

Keywords

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. 

Statistics
  • Article view489
  • Downloads0
  • Published at4 March 2013

  • RIS
  • BibTeX
  • EndNote
  • Mendeley
  • APA (7th edition)
  • MLA (9th edition)
  • Chicago
  • Harvard
  • IEEE
  • Vancouver