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 (8-16-2011)

LINEAR PROGRAMMING

Benchmark of serial LP solvers (11-9-2011)

Benchmark of parallel LP solvers (1-4-2012)

Parallel Barrier Solvers on Large LP/QP problems (11-12-2011)

Large Network-LP Benchmark (commercial vs free) (11-10-2011)

MIXED INTEGER LINEAR PROGRAMMING

MILP Benchmark - serial codes (9-29-2011)

MILP Benchmark - MIPLIB2010 (1-9-2012)

MILP cases that are slightly pathological (12-9-2011)

Feasibility Benchmark (12-10-2011) (MIPLIB2010)

Infeasibility Detection for MILP (12-9-2011) (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 (10-29-2011)

NONLINEAR PROGRAMMING

Benchmark of commercial and other (QC)QP Solvers (11-16-2011)

AMPL-NLP Benchmark, IPOPT, KNITRO, LOQO, PENNLP, SNOPT & CONOPT (11-9-2011)

MIXED INTEGER NONLINEAR PROGRAMMING

MI(QC)QP Benchmark (1-30-2012)

PROBLEMS WITH EQUILIBRIUM CONSTRAINTS

MPEC Benchmark (10-18-2010)