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 ...