An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem

Table 2

Numerical results of our algorithm on Example 9 with the large-size variables.

	Avg.N	Avg.T
(2, 100, 1000)	84.4	25.780946
(2, 100, 2000)	150.6	197.582295
(2, 100, 3000)	136.6	385.307614
(2, 100, 4000)	171.4	837.706223
(2, 100, 5000)	77.8	476.919714
(2, 100, 6000)	137.1	1418.259703
(2, 100, 7000)	140.7	2077.776716
(2, 100, 8000)	193.6	4235.722436
(2, 100, 10000)	80.2	2002.843398
(3, 100, 1000)	536.8	164.539888
(3, 100, 2000)	598.1	687.34879
(3, 100, 3000)	535.3	1249.842719
(3, 100, 4000)	760.7	3928.820802
(3, 100, 5000)	486.4	2941.007123
(3, 100, 6000)	558.1	5126.950975