<p>The standard reference is probably <a href="http://plato.asu.edu/bench.html" rel="noreferrer">Hans Mittelmann's page</a>. Note, however, that the number of simplex iterations performed will depend on the pivoting rule and how the code deals with degeneracy.</p>

CC BY-SA 3.0
2013-06-02T18:42:07.360Z
2013-06-02T18:42:07.360Z
Austin Buchanan
<p>I found this paper &quot;<a href="https://blog.zhangzhk.com/files/Comparison-of-Open-Source-Linear-Programming-Solvers.pdf" rel="nofollow noreferrer">Comparison of Open-Source Linear
Programming Solvers</a>&quot;  helpful and relatively easy to understand.</p>

CC BY-SA 4.0
2023-05-26T18:17:04.240Z
2023-05-26T18:17:04.240Z
rmacey
<p>I am searching for test instances and benchmarks for linear programming, in particular, when solved by a simplex method and implemented with floating-point arithmetic.</p>

<p>This includes test suites, to verify my implementation of the simplex method, and benchmarks to measure the performance. The performance measure relevant for me is the number of steps on the vertex graph, rather than absolute clock time. Therefore medium size instances that do not induce to much ill-conditioning would suit me best.</p>

<reference-request><linear-programming>
Test set and benchmarks for linear programming
shuhalo
# Test set and benchmarks for linear programming

(Asked by: username_0 on 2013-03-16)

I am searching for test instances and benchmarks for linear programming, in particular, when solved by a simplex method and implemented with floating-point arithmetic.

This includes test suites, to verify my implementation of the simplex method, and benchmarks to measure the performance. The performance measure relevant for me is the number of steps on the vertex graph, rather than absolute clock time. Therefore medium size instances that do not induce to much ill-conditioning would suit me best.

**Tags:** reference-request, linear-programming


---

## 2 answers

### Answer by username_1 on 2013-06-02. Score: 6

The standard reference is probably [Hans Mittelmann's page](http://plato.asu.edu/bench.html). Note, however, that the number of simplex iterations performed will depend on the pivoting rule and how the code deals with degeneracy.


---

### Answer by username_2 on 2023-05-26. Score: 1

I found this paper "[Comparison of Open-Source Linear
Programming Solvers](https://blog.zhangzhk.com/files/Comparison-of-Open-Source-Linear-Programming-Solvers.pdf)" helpful and relatively easy to understand.


---

