A Global Optimization Algorithm for Signomial Geometric Programming Problem

Table 1

The numerical results for Examples 1–4.

Example		Optimal solution	Optimal value	Iter	𝜀
1	Ours	(0.1, 9.9999, 8.0, 0.2)	0.7651	58	10^−5
	[22]	(0.1, 9.9999, 8.0, 0.2)	0.7651	132	10^−5
	[31]	(0.1015, 7.331972, 8.0169, 0.2395)	0.9514	175	10^−5
	[32]	(0.1358, 9.9324, 8.6973, 0.2365)	1.0000	171	10^−5
2	Ours	(7.8922, 0.1002, 450.0000)	7.8922	14	10^−2
	[22]	(12.0475, 0.8167, 444.9416)	12.0475	6472	10^−2
	[32]	(11.9538, 0.8150, 445.1249)	11.9538	67	10^−2
3	Ours	(149.99608, 29.9530, 3.9456)	−147.6591	156	10^−2
	[22]	(150, 30, 4.9620)	−147.6667	328	10^−2
	[21]	(88.724706796, 7.672652781, 1.317862596)	−83.2497…	1829	10^−2
	[31]	(88.6274, 7.9621, 1.3215)	−83.6898	1754	10^−2
	[33]		−83.2497,…	1809	10^−2
	[24]	(88.875643887, 7.5637589, 1.3124563877)	−83.661573642	754	10^−8
4	Ours	(43.1601, 44.9944, 69.9968, 1.2241)	460224.676188	23	10^−1
	[22]	(43.0473, 44.9317, 69.9359, 1.1338)	461200.00	968	10^−1
	[21]	(43.0137,…,44.8148,…,66.4239,…,1.1070,…)	623249.876,…	2100	10^−1
	[33]		623249.8752,…	1717	10^−1
	[24]	(43.0899785, 44.9997852, 66.419945664, 1.1069987564)	468479.996875421	1987	10^−8