An Effective Computational Algorithm for the Global Solution of a Class of Linear Fractional Programming

Table 1

Comparison of results in Problems 1– 5.

Problem	Reference	Solution	Optimum	Iter	Time
1	[1]	(0.1000, 2.3750)	−4.84151	2	0
	Ours	(0.1000, 2.3750)	−4.84151	8	0.3187
2	[8]	(1.5000, 1.5000)	4.9125	460	8.7944
	[21]	(1.5, 1.5)	4.9125874	56	1.0870
	Ours	(1.5, 1.5)	4.9125874	73	1.8091
3	[8]	(0.0000, 1.66666667, 0.0000)	3.7109	169	4.2429
	[21]	(0.0000, 1.66666667, 0.0000)	3.710919	8	0.1830
	Ours	(0, 1.6667, 0)	3.7109	132	3.5214
4	[8]	(0, 0.333333, 0)	−3.0029	2090	50.8226
	[21]	(0, 0.333333, 0)	−3.0029	17	0.1290
	Ours	(0, 0.333333, 0)	−3.0029	38	1.0237
5	[9]	(6.24409, 20.0249, 3.79672, 5.93972, 0, 7.43852, 0, 23.2833, 0.515015, 40.9896, 0, 3.14363)	16.2619	927	—
			[17]	(6.223689, 20.060317, 3.774684, 5.947841, 0, 7.456686, 0, 23.312579, 0.000204, 41.031824, 0, 3.171106)	16.077978	620	65.58
					Ours	(6.22369, 20.0603, 3.7746, 5.94784,0, 7.45668, 0,23.31257, 0, 41.03182, 0, 3.17111)	16.077978	415	7.8815