
Linear programming on a GPU: a case study 245
Problem Name Rows Cols NNZ C-to-R
80bau3b.mps 2263 9799 29063 4.3
bnl2.mps 2325 3489 16124 1.5
d2q06c.mps 2172 5167 35674 2.4
d6cube.mps 416 6184 43888 14.9
fit2p.mps 3001 13525 60784 4.5
greenbeb.mps 2393 5405 31499 2.3
maros-r7.mps 3137 9408 151120 3.0
pilot.mps 1442 3652 43220 2.5
pilot87.mps 2031 4883 73804 2.4
TABLE 10.3. NETLIB problems solved in more than 5 seconds.
80bau3b.mps
bnl2.mps
d2q06c.mps
d6cube.mps
fit2p.mps
greenbeb.mps
maros-r7.mps
pilot.mps
pilot87.mps
0
5
10
15
20
25
30
35
40
45
50
Solving time for NETLIB problems
Standard
Revised-base
Revised-opti
Revised-sparse
Time [s]
FIGURE 10.7. Time required to solve problems ...