1*
2* small test problem - tp5.mps
3*
4* knapsack problem where the greedy cover cut
5* approach leads to a violated min. cover
6*
7NAME          tp5
8ROWS
9 N  obj
10 L  knap
11 G  r1
12 G  r2
13 G  r3
14COLUMNS
15    SET00001  'MARKER'                 'INTORG'
16    x1        knap          8.000000
17    x1        r1            1.000000
18    x2        knap          7.000000
19    x2        r2            1.000000
20    x3        knap          6.000000
21    x3        r3            1.000000
22    x4        knap          4.000000
23    x4        obj          -1.000000
24    x5        knap          6.000000
25    x5        obj        -100.000000
26    x6        knap         13.500000
27    x6        obj         -10.000000
28RHS
29    RHS       knap         22.000000
30    RHS       r1            0.900000
31    RHS       r2            0.900000
32    RHS       r3            0.900000
33BOUNDS
34 BV ONE       x1            1.000000
35 BV ONE       x2            1.000000
36 BV ONE       x3            1.000000
37 BV ONE       x4            1.000000
38 BV ONE       x5            1.000000
39 BV ONE       x6            1.000000
40ENDATA
41