Models: 155 convex MINLPs from CMU-IBM MINLP page, MINLPLib, and Günlück and Linderoth (2012)
Solvers as in GAMS 23.9.2:
ECPstrategy 1 TOLepsg 1e-6 CUTdelcrit 0and CPLEX option file
EPRHS 1e-9
bonmin.algorithm B-OA milp_solver cplex number_cpx_threads 1
bonmin.algorithm B-OA
bonmin.algorithm B-Hyb
bonmin.algorithm B-ECP
bonmin.algorithm B-BB
bonmin.algorithm B-QG
maxcycles 10000 stop 1
mip_maxnodes 0 mip_maxsolves 0
memnodes 9999999
limits/memory = 20000 memory/savefac = 0.9
limits/memory = 20000 memory/savefac = 0.9 constraints/nonlinear/assumeconvex = TRUE
Timelimit: 7200 seconds
Gap tolerance: 0.000001
Threads: 1
Platform:
Results: