An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming

Table 1

Computational results for test Examples 1–4.

Example	References	Optimal solution	Iter	𝐿max	Time (s)
Example 1	ours	(1.015569395, 0.591850539, 1.401565828)	1	2	0.00332836
	[12]	(1.015695, 0.590494, 1.403675)	1	—	0.06
	[19]	(1.015678086, 0.590676676, 1.403391837)	6	5	0.01533491
Example 2	ours	(1.5, 1.5)	3	2	0.0025344
	[12]	(1.5, 1.5)	1	—	0.00
	[19]	(1.5, 1.5)	6	7	0.00579627
Example 3	ours	(1.016666667, 0.55, 1.45)	5	2	0.0110939
	[19]	(1.016666667, 0.55, 1.45)	8	8	0.02143792
Example 4	ours	(1.008333333, 0.5, 1.45)	3	2	0.00856142
	[19]	(1.008333333, 0.5, 1.45)	7	8	0.02374296