Benchmarks for Optimization Software

By Hans Mittelmann (mittelmann at asu.edu)



Note that on top of the benchmarks a link to logfiles is given!

Note also that we do not use performance profiles. See this paper

We use instead the shifted geometric mean


COMBINATORIAL OPTIMIZATION

Concorde-TSP with different LP solvers (4-15-2017)


LINEAR PROGRAMMING

Benchmark of Simplex LP solvers (6-21-2017)

Benchmark of commercial LP solvers (5-17-2017)

Parallel Barrier Solvers on Large LP/QP problems (5-18-2017)

Large Network-LP Benchmark (commercial vs free) (5-17-2017)


MIXED INTEGER LINEAR PROGRAMMING

MILP Benchmark - MIPLIB2010 (6-22-2017)

The Solvable MIPLIB Instances (5-28-2017) (MIPLIB2010)

MILP cases that are slightly pathological (5-21-2017)

Feasibility Benchmark (5-17-2017) (MIPLIB2010)

Infeasibility Detection for MILP (6-21-2017) (MIPLIB2010)


SEMIDEFINITE/SQL PROGRAMMING

SQL problems from the 7th DIMACS Challenge (8-8-2002)

Several SDP codes on sparse and other SDP problems (4-24-2017)

Infeasible SDP Benchmark (6-1-2016)

Large SOCP Benchmark (6-21-2017)

MISOCP Benchmark (5-15-2017)


NONLINEAR PROGRAMMING

AMPL-NLP Benchmark (6-20-2017)


MIXED INTEGER QPs and QCPs

Binary QPLIB Benchmark (6-8-2017)

QPLIB-QCQP Benchmark (6-4-2017)

Convex Discrete QPLIB Benchmark (6-20-2017)


MIXED INTEGER NONLINEAR PROGRAMMING

MINLP Benchmark (4-28-2017)


PROBLEMS WITH EQUILIBRIUM CONSTRAINTS

MPEC Benchmark (12-2-2016)