Problem: bpp Rows: 27 Columns: 126 (126 integer, 126 binary) Non-zeros: 252 Status: INTEGER OPTIMAL Objective: obj = 6 (MINimum) No. Row name Activity Lower bound Upper bound ------ ------------ ------------- ------------- ------------- 1 one[1] 1 1 = 2 one[2] 1 1 = 3 one[3] 1 1 = 4 one[4] 1 1 = 5 one[5] 1 1 = 6 one[6] 1 1 = 7 one[7] 1 1 = 8 one[8] 1 1 = 9 one[9] 1 1 = 10 one[10] 1 1 = 11 one[11] 1 1 = 12 one[12] 1 1 = 13 one[13] 1 1 = 14 one[14] 1 1 = 15 one[15] 1 1 = 16 one[16] 1 1 = 17 one[17] 1 1 = 18 one[18] 1 1 = 19 one[19] 1 1 = 20 one[20] 1 1 = 21 lim[1] -5 -0 22 lim[2] -30 -0 23 lim[3] 0 -0 24 lim[4] 0 -0 25 lim[5] -35 -0 26 lim[6] 0 -0 27 obj 6 No. Column name Activity Lower bound Upper bound ------ ------------ ------------- ------------- ------------- 1 x[1,1] * 1 0 1 2 x[1,2] * 0 0 1 3 x[1,3] * 0 0 1 4 x[1,4] * 0 0 1 5 x[1,5] * 0 0 1 6 x[1,6] * 0 0 1 7 x[2,1] * 0 0 1 8 x[2,2] * 0 0 1 9 x[2,3] * 0 0 1 10 x[2,4] * 0 0 1 11 x[2,5] * 1 0 1 12 x[2,6] * 0 0 1 13 x[3,1] * 1 0 1 14 x[3,2] * 0 0 1 15 x[3,3] * 0 0 1 16 x[3,4] * 0 0 1 17 x[3,5] * 0 0 1 18 x[3,6] * 0 0 1 19 x[4,1] * 1 0 1 20 x[4,2] * 0 0 1 21 x[4,3] * 0 0 1 22 x[4,4] * 0 0 1 23 x[4,5] * 0 0 1 24 x[4,6] * 0 0 1 25 x[5,1] * 0 0 1 26 x[5,2] * 1 0 1 27 x[5,3] * 0 0 1 28 x[5,4] * 0 0 1 29 x[5,5] * 0 0 1 30 x[5,6] * 0 0 1 31 x[6,1] * 1 0 1 32 x[6,2] * 0 0 1 33 x[6,3] * 0 0 1 34 x[6,4] * 0 0 1 35 x[6,5] * 0 0 1 36 x[6,6] * 0 0 1 37 x[7,1] * 1 0 1 38 x[7,2] * 0 0 1 39 x[7,3] * 0 0 1 40 x[7,4] * 0 0 1 41 x[7,5] * 0 0 1 42 x[7,6] * 0 0 1 43 x[8,1] * 0 0 1 44 x[8,2] * 1 0 1 45 x[8,3] * 0 0 1 46 x[8,4] * 0 0 1 47 x[8,5] * 0 0 1 48 x[8,6] * 0 0 1 49 x[9,1] * 0 0 1 50 x[9,2] * 0 0 1 51 x[9,3] * 0 0 1 52 x[9,4] * 0 0 1 53 x[9,5] * 0 0 1 54 x[9,6] * 1 0 1 55 x[10,1] * 0 0 1 56 x[10,2] * 0 0 1 57 x[10,3] * 0 0 1 58 x[10,4] * 0 0 1 59 x[10,5] * 1 0 1 60 x[10,6] * 0 0 1 61 x[11,1] * 0 0 1 62 x[11,2] * 0 0 1 63 x[11,3] * 0 0 1 64 x[11,4] * 1 0 1 65 x[11,5] * 0 0 1 66 x[11,6] * 0 0 1 67 x[12,1] * 0 0 1 68 x[12,2] * 0 0 1 69 x[12,3] * 1 0 1 70 x[12,4] * 0 0 1 71 x[12,5] * 0 0 1 72 x[12,6] * 0 0 1 73 x[13,1] * 0 0 1 74 x[13,2] * 0 0 1 75 x[13,3] * 0 0 1 76 x[13,4] * 1 0 1 77 x[13,5] * 0 0 1 78 x[13,6] * 0 0 1 79 x[14,1] * 0 0 1 80 x[14,2] * 0 0 1 81 x[14,3] * 1 0 1 82 x[14,4] * 0 0 1 83 x[14,5] * 0 0 1 84 x[14,6] * 0 0 1 85 x[15,1] * 0 0 1 86 x[15,2] * 0 0 1 87 x[15,3] * 1 0 1 88 x[15,4] * 0 0 1 89 x[15,5] * 0 0 1 90 x[15,6] * 0 0 1 91 x[16,1] * 0 0 1 92 x[16,2] * 0 0 1 93 x[16,3] * 0 0 1 94 x[16,4] * 0 0 1 95 x[16,5] * 0 0 1 96 x[16,6] * 1 0 1 97 x[17,1] * 0 0 1 98 x[17,2] * 0 0 1 99 x[17,3] * 0 0 1 100 x[17,4] * 1 0 1 101 x[17,5] * 0 0 1 102 x[17,6] * 0 0 1 103 x[18,1] * 0 0 1 104 x[18,2] * 0 0 1 105 x[18,3] * 0 0 1 106 x[18,4] * 0 0 1 107 x[18,5] * 1 0 1 108 x[18,6] * 0 0 1 109 x[19,1] * 0 0 1 110 x[19,2] * 0 0 1 111 x[19,3] * 0 0 1 112 x[19,4] * 0 0 1 113 x[19,5] * 0 0 1 114 x[19,6] * 1 0 1 115 x[20,1] * 0 0 1 116 x[20,2] * 1 0 1 117 x[20,3] * 0 0 1 118 x[20,4] * 0 0 1 119 x[20,5] * 0 0 1 120 x[20,6] * 0 0 1 121 used[1] * 1 0 1 122 used[2] * 1 0 1 123 used[3] * 1 0 1 124 used[4] * 1 0 1 125 used[5] * 1 0 1 126 used[6] * 1 0 1 Integer feasibility conditions: KKT.PE: max.abs.err = 0.00e+00 on row 0 max.rel.err = 0.00e+00 on row 0 High quality KKT.PB: max.abs.err = 0.00e+00 on row 0 max.rel.err = 0.00e+00 on row 0 High quality End of output