Reverse Bridge Theorem under Constraint Partition

Table 2

Results of solving selected MINLP benchmarks from the MacMINLP library. Here nc and nv represent the number of constraints and the number of variables, respectively. “—” means that no feasible solutions were found in the time limit (3600 seconds). Numbers in bold represent the best solutions among the three methods.

Test Problem			MINLP-BB		BARON		CPOPT		CPRBTH
ID	nc	nv	Sol.	Time	Sol.	Time	Sol.	Time	Sol.	Time
C-RELOAD-q-49	1430	3733	—		—	—	$-$ 1.13	66.32	$-$ 1.13	59.25
C-RELOAD-q-104	3338	13936	—	—	—	—	$-$ 1.14	298.87	$-$ 1.14	110.22
Ex12.6.3	57	92	19.6	23	19.6	423.1	19.6	13.37	19.6	13.37
Ex12.6.5	76	130	15.1	4	10.3	845.5	10.6	3.19	10.4	2.1
PUMP	34	24	—	—	131124	977	130788	81.25	130789	96.33
SPACE-960-i	6497	5537	—	—	—	—	7.65E6	179.12	7.65E6	97.22
SPACE-960-ir	3617	2657	—	—	—	—	7.64E6	132.96	7.64E6	96.34
SPACE-960	8417	15137	—	—	—	—	7.84E6	1137.13	7.84E6	1311.13
SPACE-960-r	5537	12257	—	—	—	—	5.13E6	91.56	5.13E6	87.34
STOCKCYCLE	97	480	—	—	436341	n/a	119948.7	6.12	119948.6	5.47
TRIMLON4	24	24	12.2	10	8.3	11.0	8.3	1.66	8.3	2.77
TRIMLON6	36	48	18.8	19	15.6	1092.9	15.6	13.25	15.6	7.92
TRIMLON12	72	168	—	—	—	—	95.5	298.11	95.5	345.50
TRIMLOSS4	64	105	10.8	99	—	—	10.6	8.87	10.6	7.88
TRIMLOSS5	90	161	12.6	190	—	—	10.7	75.31	10.6	78.87
TRIMLOSS6	120	215	—	—	—	—	22.1	68.19	22.1	68.19
TRIMLOSS7	154	345	—	—	—	—	26.7	58.14	26.8	37.22
TRIMLOSS12	384	800	—	—	—	—	138.8	278.33	138.1	199.10