Decision Tree for Optimization Software
 

Navigation Menu

Benchmarks for Optimization Software

by Hans Mittelmann (mittelmann at asu.edu)


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

COMBINATORIAL OPTIMIZATION

Concorde-TSP with different LP solvers (3-6-2013)

LINEAR PROGRAMMING

Benchmark of serial LP solvers (2-3-2013)

Benchmark of parallel LP solvers (5-17-2013)

Parallel Barrier Solvers on Large LP/QP problems (4-14-2013)

Large Network-LP Benchmark (commercial vs free) (4-21-2013)

MIXED INTEGER LINEAR PROGRAMMING

MILP Benchmark - MIPLIB2010 (5-17-2013)

MILP cases that are slightly pathological (5-3-2013)

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

Infeasibility Detection for MILP (5-17-2013) (MIPLIB2010)

SEMIDEFINITE/SQL PROGRAMMING

Several SDP-codes on SDP problems with free variables (4-1-2008)

Several SDP codes on problems from SDPLIB (4-10-2008)

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

Newer SDP/SOCP-codes on the 7th DIMACS Challenge problems(4-7-2008)

Several SDP codes on sparse and other SDP problems (6-22-2011)

SOCP (second-order cone programming) Benchmark (5-3-2013)

NONLINEAR PROGRAMMING

Benchmark of commercial and other (QC)QP Solvers (8-15-2012)

AMPL-NLP Benchmark, IPOPT, KNITRO, LOQO, PENNLP, SNOPT & CONOPT (5-14-2013)

MIXED INTEGER QPs and QCPs

MI(QC)QP Benchmark (5-17-2013)

MIXED INTEGER NONLINEAR PROGRAMMING

MINLP Benchmark (1/28/2013)

PROBLEMS WITH EQUILIBRIUM CONSTRAINTS

MPEC Benchmark (11-28-2012)