Research Article

Reverse Bridge Theorem under Constraint Partition

Table 1

Results of solving selected CNLP benchmarks from the CUTE library. All timing results are in seconds. 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 (600 seconds). “*” means that solutions were obtained by submitting problems through commercial version of LANCELOT but no CPU times were available. Numbers in bold represent the best solutions among the three methods.

Test ProblemLANCELOTSNOPTCPRBTH
IDncnvSol.TimeSol.TimeSol.Time

ALJAZZAF3175.000.4675.000.0175.000.05
ALLINITC4130.44*30.490.0130.490.10
ALSOTAME210.0820.570.080.010.080.09
AVION249459.47E70.019.47E70.10
BATCH46732.59E50.012.59E50.11
BT11530.8250.620.820.010.820.07
BT12536.1880.476.190.016.190.07
BT6520.2770.560.280.010.280.07
CB2331.9520.601.950.011.950.07
CRESC4680.870.010.870.01
CSFI154-49.070.63- 49.080.01- 49.080.09
DIPIGRI74680.60.68680.630.01680.630.09
DIXCHLNG1050.01.122.47E30.012.47E30.05
DNIEPER61241.87E40.831.87E40.011.87E40.13
EXPFITA5221.13E-30.650.000.010.000.10
GAUSSELM1411-2.250.550.00104.900.000.12
HIMMELBI10012-1735.61.23- 1755.000.01- 1755.000.13
HIMMELP221-62.050.63- 62.050.01- 62.050.05
HIMMELP625-59.010.69- 59.010.01- 59.010.05
HONG4122.570.501.350.011.350.05
HUBFIT210.01690.460.020.010.020.04
LOADBAL31310.4530.690.450.010.450.12
MADSEN360.6160.550.620.010.620.03
MARATOS21- 1.000.40- 1.000.01- 1.000.02
MATRIX2620.000.520.000.010.000.01
MISTAKE913- 1.000.58- 1.000.01- 1.000.11
MWRIGHT5324.970.5624.980.0124.980.01
ODFITS106-23800.50- 2380.030.01- 2380.030.03
OPTCNTRL3220550.000.51550.000.01550.000.03
OPTPRLOC3030- 16.424.02- 16.420.01- 16.420.11
OPTHREGB2760.00.760.000.010.000.06
PENTAGON6151.509E-40.560.000.010.000.09