An Efficient Polynomial Time Algorithm for a Class of Generalized Linear Multiplicative Programs with Positive Exponents

Table 1

Comparison of results in Problems 1–6.

Problem	Reference	Optimal solution	Optimal optimum
1	Locatelli [17]	(1.3148, 0.1396, 0.0000, 0.4233)	0.890190
	Shen and Wang [18]	(1.3148, 0.1396, 0.0000, 0.4233)	0.890190
	Liu and Zhao [8]	(1.3148, 0.13955, 2.6891 , 0.42329)	0.890190
	Algorithms 1/2	(1.3148, 0.1396, 0.0000, 0.4233)	0.890190
2	Locatelli [17]	(3.000, 2.000)	5.014514
	Shen and Wang [18]	(3.000, 2.000)	5.009309
	Liu and Zhao [8]	(3.000, 2.000)	5.009309
	Algorithm 1	(3.000, 2.000)	5.009309
	Algorithm 2	(3.000, 2.000)	5.009309
3	Liu and Zhao [8]	(1, 1)	997.661265
	Locatelli [17]	(1, 1)	997.661265
	Shen and Wang [18]	(1, 1)	997.661265
	Algorithm 1/2	(1, 1)	997.661265
4	Shen and Hang [20]	(2, 8)	10
	Algorithm 1/2	(2, 8)	10
5	Zhang et al. [19]	(0.0, 8.0, 1.0, …)	0.91235
	Algorithm 1	(0.0, 8.0, 1.0, …)	0.91235
	Algorithm 2	(0.0, 8.0, 1.0, …)	0.91235
6	Liu and Zhao [8]	(1.25, 1)	263.785989
	Algorithm 1	(1.25, 1)	263.785989
	Algorithm 2	(1.25, 1)	263.785989