Skip to main content
. Author manuscript; available in PMC: 2015 Feb 1.
Published in final edited form as: Math Program. 2012 Oct 26;143(1-2):339–356. doi: 10.1007/s10107-012-0612-1

Table 1.

Numerical examples of unconstrained signomial programming. Test functions f4(x), f6(x), f7(x), f8(x) and f9(x) are taken from [20]. P: posynomial; S: signomial; G: general function.

Fun Type Initial Point x0 Min Point Min Value Iters (10−9)
f1 P (1,2) (1.4310,1.4310) 3.4128 38
f2 P (1,2) (0.6300,1.2599) 2.0000 2
f3 P (1,1) diverges 0.0000
f4 S (0.1,0.2,0.3,0.4) (0.1596,0.3191,0.1954,0.2606) 0.0000 3
f5 G (1,1,1) (0.4082,0.4082,0.4082) 0.2973 2
(1,2,3) diverges −∞
f6 S (1,1) (2.9978,0.4994) −14.2031 558
f7 S (1, …, 10) 0.0255x0 0.0000 18
f8 P (1, …, 7) diverges 0.0000
f9 P (1,2,3,4) (0.3969,0.0000,0.0000,1.5874) 2.0000 7