A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming

Table 1

Computational results of test problems (2.2)–(4.9).

Example	Methods	Optimal solution	Optimal value	Iter	Time
1	[12]	(1.0, 1.0)	997.661265160	49	0
	[15]	(1.0, 1.0)	997.6613	5	0.0984
	ours	(1.0, 1.0)	997.6613	1	0.0160
2	[15]	(1.0, 2.0, 1.0)	3.7127	10	0.2717
	ours	(1.0, 2.0, 1.0)	3.7127	1	0.0150
3	[12]	(1.0, 1.0, 1.0)	60.0	64	0
	[15]	(1.0, 1.0, 1.0)	60.0	1	0.0126
	ours	(1.0, 1.0, 1.0)	60.0	1	0.0148
4	[13]	(0.0, 0.0)	0.533333333	3	0
	[16]	(0.0, 0.0)	0.533333	16	0.05
	ours	(0.0, 0.0)	0.5333	2	0.0221
5	[11]	(1.0, 1.0)	275.074284	1	0
	[15]	(1.0, 1.0)	275.0743	1	0.0105
	ours	(1.0, 1.0)	275.0743	1	0.0102