Solving a class of generalized fractional programming problems using the feasibility of linear programs

Journal of Inequalities and Applications

Table 1 Computational results of Examples 1 - 5

	Algorithm	ε	Solution	Optimum	Iter	Nodes	CPU(s)
1	[21]	0.2	(0, 0.2816)	1.6232	5,122	862	185.2
	[19]	0.2	(0, 0.2816)	1.6232	1,122	327	84.9
	Our	0.2	(0, 0.2816)	1.6232	17	5	0.46
2	[21]	0.2	(5.382 × 10⁻¹⁶, 5.536 × 10⁻¹⁶)	0.5333	631	217	10.4
	[19]	0.2	(5.382 × 10⁻¹⁶, 5.536 × 10⁻¹⁶)	0.5333	362	122	5.63
	Our	0.2	(5.382 × 10⁻¹⁶, 5.536 × 10⁻¹⁶)	0.5333	55	13	1.83
3	[21]	0.15	(0, 0, 1.6886, 4.3466, 4.3007, 4.0334, 0, 1.4324, 0.7765, 4.1967, 0, 4.1385)	0.05115	24,569	3,727	355.2
	[19]	0.15	(0, 0, 1.6886, 4.3466, 4.3007, 4.0334, 0, 1.4324, 0.7765, 4.1967, 0, 4.1385)	0.05115	14,669	3,215	215.2
	Our	0.15	(0, 0, 1.6886, 4.3466, 4.3007, 4.0334, 0, 1.4324, 0.7765, 4.1967, 0, 4.1385)	0.05115	70	21	5.66
4	[19]	0.1	(1.7177, 2.0155)	32.39	1,998	487	118.8
4	Our	0.1	(1.7177, 2.0155)	32.39	41	15	32.39
5	[19]	0.05	(2.0814, 2.9963)	7,709.8	4,383	1,327	256.9
5	Our	0.05	(2.0814, 2.9963)	7,709.8	924	385	56.2