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 (12-20-2017)


LINEAR PROGRAMMING

Benchmark of Simplex LP solvers (4-25-2018)

Benchmark of commercial LP solvers (5-4-2018)

Parallel Barrier Solvers on Large LP/QP problems (4-25-2018)

Large Network-LP Benchmark (commercial vs free) (4-25-2018)


MIXED INTEGER LINEAR PROGRAMMING

MILP Benchmark - MIPLIB2010 (4-25-2018)

The Solvable MIPLIB Instances (4-28-2018) (MIPLIB2010)

MILP cases that are slightly pathological (4-25-2018)

Feasibility Benchmark (4-25-2018) (MIPLIB2010)

Infeasibility Detection for MILP (4-25-2018) (MIPLIB2010)


SEMIDEFINITE/SQL PROGRAMMING

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

Several SDP codes on sparse and other SDP problems (1-17 2018)

Infeasible SDP Benchmark (5-9-2018)

Large SOCP Benchmark (4-25-2018)

MISOCP Benchmark (4-25-2018)


NONLINEAR PROGRAMMING

AMPL-NLP Benchmark (4-16-2018)


MIXED INTEGER QPs and QCPs

Non-commercial convex QP Benchmark (5-21-2018)

Binary QPLIB Benchmark (4-27-2018)

QPLIB-QCQP Benchmark (2-26-2018)

Convex Discrete QPLIB Benchmark (4-25-2018)


MIXED INTEGER NONLINEAR PROGRAMMING

MINLP Benchmark (4-16-2018)


PROBLEMS WITH EQUILIBRIUM CONSTRAINTS

MPEC Benchmark (4-17-2018)