An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming

Table 2

Numerical results for Example 5.

Example 5	Our algorithm			Algorithm of [19]
(𝑝,𝑀,𝑁)	Iter	𝐿max	Time (s)	Iter	𝐿max	Time (s)
(3,4,5)	59	16	0.18905	90	88	0.308533
(5,5,5)	173	40	0.560235	440	438	2.070590
(5,5,6)	211	46	0.996647	328	314	1.954055
(6,6,5)	88	18	0.382545	348	348	2.012132
(7,5,6)	88	16	0.545829	174	159	1.315186
(30,6,6)	74	13	2.21828	151	148	6.439019
(50,6,6)	29	2	2.08805	95	81	9.848997
(10,7,6)	454	131	3.79913	685	659	7.590868
(7,7,7)	154	30	1.30391	242	235	2.713118
(7,7,8)	733	175	7.4577	8913	8901	157.815951
(20,9,8)	55	6	1.65562	125	123	4.672965
(9,7,10)	2243	570	42.8553	3581	3400	79.042373
(10,10,10)	258	20	5.69239	450	200	11.414042