Comparative study of defferent methods for solving linear fractional programming problem

Abstract

In this thesis, we study the established methods ofCbames & Cooper, Bin-an & Novacs and Swamp's primal & dual simplex type for solving linear fmctional programming problem, suggest a modification for Swamp's simplex type method and compare the methods among themselves. To apply these methods on largescale linear fractional programming problem, we need computer-oriented program of these methods, To fulfill this purpose, we develop computer program (FORTRAN) ofthesc methods and apply on a sizable largc-scale linear fractional programming problem of an agricultural farm. Finally, conclusion is drawn in favour of our modified approach of Swarup's primal simplex method.