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 (11-26-2016)



LINEAR PROGRAMMING

Benchmark of Simplex LP solvers (3-27-2017)

Benchmark of commercial LP solvers (3-27-2017)

Parallel Barrier Solvers on Large LP/QP problems (3-27-2017)

Large Network-LP Benchmark (commercial vs free) (3-27-2017)



MIXED INTEGER LINEAR PROGRAMMING

MILP Benchmark - MIPLIB2010 (3-27-2017)

The Solvable MIPLIB Instances (3-27-2017) (MIPLIB2010)

MILP cases that are slightly pathological (3-27-2017)

Feasibility Benchmark (3-27-2017) (MIPLIB2010)

Infeasibility Detection for MILP (3-27-2017) (MIPLIB2010)



SEMIDEFINITE/SQL PROGRAMMING

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

Several SDP codes on sparse and other SDP problems (10-13-2016)

Infeasible SDP Benchmark (11-18-2016)

Large SOCP Benchmark (3-27-2017)

MISOCP Benchmark (3-27-2017)



NONLINEAR PROGRAMMING

AMPL-NLP Benchmark (1-20-2017)



MIXED INTEGER QPs and QCPs

MIQ(C)P Benchmark (3-27-2017)



MIXED INTEGER NONLINEAR PROGRAMMING

MINLP Benchmark (1-17-2017)



PROBLEMS WITH EQUILIBRIUM CONSTRAINTS

MPEC Benchmark (12-2-2016)