Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation

Table 1

Results of the numerical contrast experiments 1–6.

Exam.	Ref.	Opt. val.	Opt. sol.	Iter.	Time (s)	Prec.
1	in Shen et al. [23]			1657	120.58
	Ours			31	0.34449
2	In Wang and Liang [25]			44	0.18
	In Jiao [26]			58	<1
	Ours			1	0.0137
3	In Jiao [26]			43	-
	Ours			1	0.0214
4	In Shen and Jiao [19, 20]			24	-
	In Jiao et al. [22]			16	0.018
	Ours			1	0.0351
5	In Shen and Jiao [19, 20]			434	1
	In Jiao et al. [22]			189	0.226
	Ours			3	0.1534
6	In Jiao et al. [22]			25	0.750
	Ours			1	0.01436