Optimization Test Problems | The Optimization Firm

The following test libraries are routinely used in the context of developing BARON. Some of these problems originate from applications, while others have been designed to test, develop, or challenge solvers:

bcp: Bound-constrained programs from [13], available in BARON, GAMS, MATLAB and PYOMO format.
binqp: Binary quadratic programs from [8], available in BARON, GAMS, MATLAB and PYOMO format.
boxqp: Box-constrained quadratic programs from [6], available in BARON, GAMS, MATLAB and PYOMO format.
boxqpx2: A collection of box-constrained quadratic programs from [16], available in BARON, GAMS, MATLAB and PYOMO format.
eiqp2: A collection of equality integer quadratic programs from [16], available in BARON, GAMS, MATLAB and PYOMO format.
global: Nonlinear optimization problems from [1], available in BARON, GAMS, MATLAB and PYOMO format.
ibm: Mixed-integer nonlinear optimization problems from [9], available in BARON, GAMS, MATLAB and PYOMO format.
inf: Infeasible linear, nonlinear and mixed-integer nonlinear optimization problems from [10], available in BARON, GAMS, MATLAB and PYOMO format.
lgmiqp: A collection of cardinality binary quadratic programs from [15], available in BARON, GAMS, MATLAB and PYOMO format.
minlp: Mixed-integer nonlinear optimization problems from [1], available in BARON, GAMS, MATLAB and PYOMO format.
minlprlp: LP relaxations of mixed-integer nonlinear optimization problems from [17], available in BARON, GAMS, LP and MPS format.
mpec: Mathematical programs with complementarity constraints from [2], available in BARON, GAMS, MATLAB and PYOMO format.
morg: Mixed-integer nonlinear optimization problems from [7], available in BARON, GAMS, MATLAB and PYOMO format.
mult3: Multilinear programs from [5], available in BARON, GAMS, MATLAB and PYOMO format.
mult4: Multilinear programs from [5], available in BARON, GAMS, MATLAB and PYOMO format.
poly: Polynomial optimization problems from [11] and [12], available in BARON, GAMS, MATLAB and PYOMO format.
prince: Nonlinear optimization problems from [1], available in BARON, GAMS, MATLAB and PYOMO format.
qcqp: Quadratically constrained quadratic programs from [3], available in BARON, GAMS, MATLAB and PYOMO format.
qcqp2: Quadratically constrained quadratic programs from [4], available in BARON, GAMS, MATLAB and PYOMO format.
qcqp3: Quadratically constrained quadratic programs from [5], available in BARON, GAMS, MATLAB and PYOMO format.
qsap1: A collection of quadratic semi-assignment programs from [16], available in BARON, GAMS, MATLAB and PYOMO format.
sr: A collection of symbolic regression problems from [14], available in BARON, GAMS, MATLAB and PYOMO format.

Sources:

MINLPlib.
MPECLib.
Bao, X., N. V. Sahinidis, and M. Tawarmalani, Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs, Optimization Methods and Software, 24, 485-504, 2009.
Bao, X., N. V. Sahinidis and M. Tawarmalani, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Mathematical Programming, 129, 129-157, 2011.
Bao, X., A. Khajavirad, N. V. Sahinidis, and M. Tawarmalani, Global optimization of nonconvex problems with multilinear intermediates, Mathematical Programming Computation, 7, 1-37, 2015.
Vandenbussche, D. and G. Nemhauser, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Mathematical Programming, 102, 559-575, 2005.
minlp.org.
OR-Lib.
CMU-IBM open-source MINLP project.
Puranik, Y. and N. V. Sahinidis, Deletion presolve for accelerating infeasibility diagnosis in optimization models, INFORMS Journal on Computing, 29, 754-766, 2017.
Sherali, H. D., E. Dalkiran and J. Desai, Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts, Computational Optimization and Applications, 52, 483-506, 2012.
Sherali, H. D., E. Dalkiran and L. Liberti, Reduced RLT representations for nonconvex polynomial programming problems, Journal of Global Optimization, 52, 447-469, 2012.
Puranik, Y. and N. V. Sahinidis, Bounds tightening on optimality conditions for nonconvex box-constrained optimization, Journal of Global Optimization, 67, 59-77, 2017.
Cozad, A. and N. V. Sahinidis, A global MINLP approach to symbolic regression, Mathematical Programming, 170, 97-119, 2018.
Lima, R. M. and I. E. Grossmann, On the solution of nonconvex cardinality boolean quadratic programming problems: A computational study, Computational Optimization and Applications, 66, 1-37, 2017.
Nohra, C. J., A. U. Raghunathan and N. V. Sahinidis, Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs, SIAM Journal on Optimization, 31, 142-171, 2021.
Zhang, Y., N. Ploskas and N. V. Sahinidis, A novel linear programming presolve technique based on Fourier-Motzkin elimination, forthcoming, 2024.