A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming

Table 1

Computational results of test problems.

Example	𝑝	(𝑚,𝑛)	Iter	Time
1	4	(10,10)	39.8	28.7
2	4	(10,20)	44.2	30.3
3	4	(20,20)	69.1	38.5
4	5	(10,10)	43.6	29.9
5	5	(10,20)	50.7	35.0
6	5	(20,20)	82.8	45.7
7	6	(10,20)	56.2	30.4
8	7	(10,20)	67.0	34.5
9	8	(10,20)	85.6	49.9
10	9	(10,20)	116.7	78.0